Scheduling;
Parallel machines;
Linear programming;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
We present a linear programming approach to the problem of scheduling equal processing time jobs with release dates and deadlines on identical parallel machines. The known algorithm with complexity O(n3log log n) of B. Simons schedules all the jobs while minimizing both the maximum completion time and the mean flow time. Our approach permits also to minimize the weighted sum of completion times and total tardiness in polynomial time for the problems without deadlines. The complexity status of these problems was open.
机构:
Univ Modena & Reggio Emilia, DISMI, Via Amendola 2, I-42122 Reggio Emilia, ItalyUniv Modena & Reggio Emilia, DISMI, Via Amendola 2, I-42122 Reggio Emilia, Italy
Kramer, Arthur
Iori, Manuel
论文数: 0引用数: 0
h-index: 0
机构:
Univ Modena & Reggio Emilia, DISMI, Via Amendola 2, I-42122 Reggio Emilia, ItalyUniv Modena & Reggio Emilia, DISMI, Via Amendola 2, I-42122 Reggio Emilia, Italy
Iori, Manuel
Lacomme, Philippe
论文数: 0引用数: 0
h-index: 0
机构:
Univ Clermont Auvergne, ISIMA, 1 Rue Chebarde, F-63178 Aubiere, FranceUniv Modena & Reggio Emilia, DISMI, Via Amendola 2, I-42122 Reggio Emilia, Italy