Pareto optima for total weighted completion time and maximum lateness on a single machine

Discrete Applied Mathematics

Volumn 155, Issue 17, 2007, Pages 2341-2354

  Steiner, George ^a   Stephenson, Paul ^b  

^a MCMASTER UNIVERSITY   (Canada)

^b ACADIA UNIVERSITY   (Canada)

Author keywords

Algorithm; Dominance orders; Due dates; Lateness; Master sequence; Pareto optima; Scheduling; Weighted completion time

Indexed keywords

ALGORITHMS; GLOBAL OPTIMIZATION; PROBLEM SOLVING;

LATENESS OBJECTIVES; SEQUENCING PROBLEMS; SEVAUX; SINGLE-MACHINE BICRITERION SCHEDULING PROBLEM;

PARETO PRINCIPLE;

EID: 34648814077     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.06.012     Document Type: Article

References (20)

1. Bagchi T.P. Pareto-optimal solutions for multi-objective production schedules. Lecture Notes in Comput. Sci. 1993 (2001) 458-471
2. Bagchi U., and Ahmadi R.H. An improved lower bound for minimizing weighted completion times with deadlines. Oper. Res. 35 (1987) 311-313
3. Cheng J., Steiner G., and Stephenson P. Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. J. Scheduling 5 (2002) 71-92
4. Daniels R.L., and Chambers R.J. Multiobjective flow-shop scheduling. Naval Res. Logist. 37 (1990) 981-985
5. Dauzère-Pérès S., and Sevaux M. Using Lagrangian relaxation to minimize the weighted number of late jobs on a single machine. Naval Res. Logist. 50 (2003) 273-288
6. Dauzère-Pérès S., and Sevaux M. An exact method to minimize the number of tardy jobs in single machine scheduling. J. Scheduling 7 (2004) 405-420
7. Erschler J., Fontan G., Merce C., and Roubellat F. A new dominance concept in scheduling n jobs on a single machine with ready times and due dates. Oper. Res. 31 (1983) 114-127
8. Hoogeveen J.A., and van de Velde S.L. Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Oper. Res. Lett. 17 (1995) 205-208
9. Köksalan M., and Keha A.B. Using genetic algorithms for single-machine bicriteria scheduling problems. European J. Oper. Res. 145 (2003) 543-556
10. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys D. Sequencing and scheduling: algorithms and complexity. In: Graves S.S., Rinnooy Kan A.H.G., and Zipkin P. (Eds). Handbooks in Operations Research and Management Science vol. 4 (1993), North-Holland, New York 445-522
11. Lenstra J.K., Rinnooy Kan A.H.G., and Brucker P. Complexity of machine scheduling problems. Ann. Discrete Math. 1 (1977) 342-362
12. Liao C.J., Yu W.C., and Joe C.B. Bicriterion scheduling in the two-machine flowshop. J. Oper. Res. Soc. 48 (1997) 929-935
13. Murata T., Ishibuchi H., and Tanaka H. Multi-objective genetic algorithm and its applications to flowshop scheduling. Comput. Ind. Eng. 30 (1996) 957-968
14. Pan Y. An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. Oper. Res. Lett. 31 (2003) 492-496
15. Posner M.E. Minimizing weighted completion times with deadlines. Oper. Res. 33 (1985) 562-574
16. Potts C.N., and Van Wassenhove L.N. An algorithm for single machine sequencing with deadlines to minimize total weighted completion time. European J. Oper. Res. 12 (1983) 379-387
17. Tadei R.A., Grosso, and Della Croce F. Finding the Pareto-optima for the total and maximum tardiness single machine problem. Discrete Appl. Math. 124 (2002) 117-126
18. Taillard E. Benchmarks for basic scheduling problems. European J. Oper. Res. 64 (1993) 278-285
19. T'kindt V., and Billaut J.C. Multicriteria Scheduling: Theory, Models and Algorithms (2002), Springer, Berlin
20. Werner F. A branch and bound algorithm for minimizing weighted completion times with deadlines. Optimization 28 (1993) 187-199