A note on flow-shop and job-shop batch scheduling with identical processing-time jobs

0.00 Avg rating—0 Votes

Article ID:	iaor20053083
Country:	Netherlands
Volume:	161
Issue:	1
Start Page Number:	285
End Page Number:	291
Publication Date:	Feb 2005
Journal:	European Journal of Operational Research
Authors:	Mosheiov Gur, Oron Daniel
Keywords:	flowshop, job shop

Abstract:

We address a batch scheduling problem of n identical processing time jobs on an m-machine flow-shop and a 2-machine job-shop. The objective is makespan minimization. Both problems are shown to be solved in O(n).

Reviews

Required fields are marked *. Your email address will not be published.