论文信息 - Bi-criteria scheduling problem on three identical parallel machines

Bi-criteria scheduling problem on three identical parallel machines

In this paper, we consider two and three identical parallel machine scheduling problems which are desired to minimize two criteria, maximum completion time and maximum lateness. We exploit the Sahni's algorithm for our bi-criteria problem and give the entire trade off curve of schedule, which are nondominated for two criteria.

[1] Robert McNaughton,et al. Scheduling with Deadlines and Loss Functions , 1959 .

[2] K. R. Baker,et al. A bicriterion approach to time/cost trade-offs in sequencing , 1982 .

[3] Sartaj Sahni,et al. Preemptive Scheduling with Due Dates , 1979, Oper. Res..

[4] W. A. Horn. Some simple scheduling algorithms , 1974 .

[5] Ludo Gelders,et al. Solving a bicriterion scheduling problem , 1980 .

[6] Hiroaki Ishii,et al. Two Machine open Shop Scheduling Problem with Bi-criteria , 1994, Discret. Appl. Math..

[7] Michael Pinedo,et al. Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis , 1995, INFORMS J. Comput..