Advances in Operations Research
Volume 2009 (2009), Article ID 153910, 10 pages
Research Article

Batch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times

1Department of Statistics, The Hebrew University of Jerusalem, Jerusalem 91905, Israel
2School of Business Administration, The Hebrew University of Jerusalem, Jerusalem 91905, Israel
3Faculty of Economics and Business, The University of Sydney, NSW 2006, Australia

Received 19 August 2008; Revised 21 April 2009; Accepted 23 June 2009

Academic Editor: George Steiner

Copyright © 2009 Lika Ben-Dati et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.