《2016 Scheduling jobs on parallel machines to minimize a regular step total cost function》.pdf

J Sched (2011) 14:523–538 DOI 10.1007/s10951-010-0203-z Scheduling jobs on parallel machines to minimize a regular step total cost function Boris Detienne · Stéphane Dauzère-Pérès · Claude Yugma Published online: 5 November 2010 © Springer Science+Business Media, LLC 2010 Abstract This paper deals with a parallel machine schedul- In total cost minimization problems, a cost is associated ing problem whose objective is to minimize a regular step to- with each task in the schedule, depending on its completion tal cost function. A real world application of the problem is time. The cost of the schedule is defined as the sum of the presented, and Mixed Integer Linear Programming models costs of all tasks, and it has to be minimized. Total cost prob- are described for the cases with and without release dates, lems cover a wide variety of objectives, the most famous as well as a dedicated constraint generation procedure. Ex- ones are the minimization of the total flow time (denoted in perimental results are reported and discussed to evaluate the the literature by w C ), of the weighted number of late i i i relevance of the different approaches on well-known special jobs ( w U ), of the weighted sum of the total tardiness i i i cases and the general case. ( w T ) or lateness ( w L ), or the weighted sum of i i i i i i the total earliness and tardiness ( (α E + β T ))