Batch scheduling on two-machine flowshop with machine-dependent setup times

Abstract

We study a batch scheduling problem on a 2-machine flowshop. We assume unit processing time jobs, batch availability, and machine-dependent setup times. The objective is to find a job allocation to batches of integer size and a batch schedule that minimize makespan. We introduce a very efficient closed form solution for the problem. © 2009 Lika Ben-Dati et al.