Learn More
We introduce the batch sequencing problem (BSP) with item and batch availability for the single-machine and two-machine ow-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(More)
  • 1