Parallel Machine Scheduling of Deteriorating Jobs by Modified Steepest Descent Search
In the paper two problems of scheduling time-dependent jobs on parallel machines are considered. In both problems the processing time of each job is described by a linear function of the starting time of the job. The criterion of optimality of a schedule is either the total completion time or the total machine load. First, an equivalence of these two problems is proved. Next, several properties of the problems are shown. Finally, two heuristic algorithms based on the steepest descent search are proposed and results of their experimental evaluation are reported.
Keywordsdeteriorating jobs parallel machine scheduling total completion time total machine load heuristic algorithms steepest descent search
Unable to display preview. Download preview PDF.
- 2.Chen, Z.-L.: Parallel machine scheduling with time dependent processing times. Discr. Appl. Math. 70, 81–93. Erratum: Discr. Appl. Math. 75, 103 (1996)Google Scholar
- 6.Jeng, A.A.-K., Lin, B.M.-T.: Parallel-machine scheduling with deteriorating jobs to minimize total completion time April 2004 (unpublished manuscript)Google Scholar
- 9.Mosheiov, G.: Multi-machine scheduling with linear deterioration. Infor. 36, 205–214 (1998)Google Scholar