Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop

0.00 Avg rating—0 Votes

Article ID:	iaor1991152
Country:	Netherlands
Volume:	44
Issue:	3
Start Page Number:	331
End Page Number:	336
Publication Date:	Feb 1990
Journal:	European Journal of Operational Research
Authors:	Bagchi Uttarayan, Ahmadi Reza H.
Keywords:	scheduling

Abstract:

The paper considers the classic n job, m machine scheduling problem where the objective is to minimize the sum of completion times. A procedure is presented for obtaining m-1 new machine based lower bounds. The result is an improved overall lower bound.

Reviews

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