batch scheduling on two-machine flowshop with machine-dependent setup times在两批处理调度flowshop与计算机有关的设置时间.pdfVIP

Hindawi Publishing Corporation Advances in Operations Research Volume 2009, Article ID 153910, 10 pages doi:10.1155/2009/153910 Research Article Batch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times Lika Ben-Dati,1 Gur Mosheiov,1, 2 and Daniel Oron3 1 Department of Statistics, The Hebrew University of Jerusalem, Jerusalem 91905, Israel 2 School of Business Administration, The Hebrew University of Jerusalem, Jerusalem 91905, Israel 3 Faculty of Economics and Business, The University of Sydney, NSW 2006, Australia Correspondence should be addressed to Daniel Oron, d.oron@.au Received 19 August 2008; Revised 21 April 2009; Accepted 23 June 2009 Recommended by George Steiner 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. Copyright q 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. 1. Introduction The recent survey paper “A Survey on Scheduling Problems with Setup Times and Costs” 1, classifies batch scheduling problems into those with batching and nonbatching considerations, with sequence-independent and sequence-dependent setup times, and according to the machine environment and the objective function. The survey contains approximately 300 references, a clear indication of the importance and relevance of this topic. In this paper