A two-phase genetic algorithm to solve variants of the batch sequencing problem

摘要

We introduce the batch sequencing problem (BSP) with item and batch avail- ability for the single-machine and two-machine flow-shop case. We propose a genetic algorithm which solves the BSP through a decomposition into a phase I- batching and a phase II-scheduling decision. The batch sequencing problem is closely related to the discrete lotsizing and scheduling problem (DLSP). Computational experience shows that the genetic algorithm for solving the BSP Favourably compares with procedures for solving the DLSP.