Lower bounds for single-machine scheduling problems

0.00 Avg rating—0 Votes

Article ID:	iaor1991535
Country:	United States
Volume:	37
Issue:	6
Start Page Number:	967
End Page Number:	979
Publication Date:	Dec 1990
Journal:	Naval Research Logistics
Authors:	Bagchi Uttarayan, Ahmadi Reza H.

Abstract:

This article addresses deterministic, nonpreemptive scheduling of n jobs with unequal release times on a single machine to minimize the sum of job completion times. This problem is known to be NP-hard. The article compares six available lower bounds in the literature and shows that the lower bound based on the optimal solution to the preemptive version of the problem is the dominant lower bound.

Reviews

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