New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs

European Journal of Operational Research

Volumn 201, Issue 1, 2010, Pages 89-98

  Erenay, Fatih Safa ^a   Sabuncuoglu, Ihsan ^b   Toptal, Ayşegül ^b   Tiwari, Manoj Kumar ^c  

^a University of Wisconsin Madison   (United States)

^b BILKENT UNIVERSITY   (Turkey)

^c INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Average flowtime; Beam search; Bicriteria scheduling; Number of tardy jobs

Indexed keywords

AVERAGE FLOWTIME; BEAM SEARCH; BEAM SEARCH HEURISTICS; BICRITERIA SCHEDULING; BICRITERIA SCHEDULING PROBLEM; COMPUTATIONAL EXPERIMENT; CONSTRUCTIVE ALGORITHMS; FLOW-TIME; META-HEURISTIC APPROACH; MULTI-OBJECTIVE SCHEDULING PROBLEMS; NEW SOLUTIONS; NP-HARD; NUMBER OF TARDY JOBS; SINGLE MACHINES;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; SUPPLY CHAINS;

TABU SEARCH;

EID: 70249139909     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2009.02.014     Document Type: Article

References (37)

1. Allahverdi A. A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness. Computers and Operations Research (2004) 31; 157-180
2. Arroyo J.E.C., and Armentano V.A. Genetic local search for multi-objective flowshop scheduling problems. European Journal of Operational Research 167 (2005) 717-738
3. Chen C.L., and Bulfin R.L. Complexity of single machine multi-criteria scheduling problems. European Journal of Operational Research 70 (1993) 115-125
4. Dileepan P., and Sen T. Bicriterion static scheduling research for a single machine. Omega 16 (1988) 53-59
5. Emmons H. One machine sequencing to minimize mean flowtime with minimum tardy. Naval Research Logistics Quarterly 22 (1975) 585-592
6. Fry T., Armstrong R., and Lewis H. A framework for single machine multiple objective scheduling research. Omega 17 (1989) 595-607
7. Ghirardi M., and Potts C.N. Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach. European Journal of Operational Research 165 2 (2005) 457-467
8. Güner E., Erol S., and Tani K. One machine scheduling to minimize maximum earliness with minimum number of tardy jobs. International Journal of Production Economics 55 (1998) 213-219
9. Gupta J.N.D., and Ruiz-Torres A.J. Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs. European Journal of Operational Research 167 (2005) 679-695
10. Haral U., Chen R.-W., Ferrell W.G., and Kurz M.B. Multiobjective single machine scheduling with nontraditional requirements. International Journal of Production Economics 106 (2007) 574-584
11. Heck H., and Roberts S. A note on the extension of a result on scheduling with secondary criteria. Naval Research Logistics Quarterly 19 (1972) 403-405
12. Hoogeveen J.A. Multicriteria scheduling. European Journal of Operational Research 167 (2005) 592-623
13. Huo Y., Leung J.Y.T., and Zhao H. Complexity of two-dual criteria scheduling problems. Operations Research Letters 35 (2007) 211-220
14. Kiran A.S., and Unal A.T. A single-machine problem with multiple criteria. Naval Research Logistics 38 (1991) 721-727
15. Kondakci S.K., and Bekiroglu T. Scheduling with bicriteria: Total flowtime and number of tardy jobs. International Journal of Production Economics 53 (1997) 91-99
16. Kondakci S., Azizoglu M., and Köksalan M. Single machine scheduling with maximum earliness and number tardy. Computers and Industrial Engineering 45 (2003) 257-269
17. Köksalan M. A heuristic approach to bicriteria scheduling. Naval Research Logistics 46 (1999) 777-789
18. Köksalan M., and Keha A.B. Using genetic algorithms for single-machine bicriteria scheduling problems. European Journal of Operational Research 145 (2003) 543-556
19. Köksalan M., Azizoglu M., and Kondakci S. Minimizing flowtime and maximum earliness on a single machine. IIE Transactions 30 (1998) 192-200
20. Köktener E.K., and Köksalan M. A simulated annealing approach to bicriteria scheduling problems on a single machine. Journal of Heuristics 6 (2000) 311-327
21. Lee W.-C., Wu C.-C., and Sung H.-J. A bi-criterion single-machine scheduling problem with learning considerations. Acta Informatica 40 (2004) 303-315
22. M'Hallah R. Minimizing total earliness and tardiness on a single machine using a hybrid heuristic. Computers and Operations Research 34 (2007) 3126-3142
23. Moore J.M. An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science 15 (1968) 102-109
24. Nagar A., Haddock J., and Heragu S. Multiple and bicriteria scheduling: A literature survey. European Journal of Operations Research 81 (1995) 88-104
25. Nelson R.T., Sarin R.K., and Daniels R.L. Scheduling with multiple performance measures: The one machine case. Management Science 32 (1986) 464-479
26. Sabuncuoglu I., and Bayiz M. Job shop scheduling with beam search. European Journal of Operational Research 118 (1999) 390-412
27. Sabuncuoglu I., and Karabuk S. A beam search algorithm and evaluation of scheduling approaches for FMSs. IIE Transactions 30 (1998) 179-191
28. Sabuncuoglu I., Gockun Y., and Erel E. Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling. European Journal of Operational Research 186 (2008) 915-930
29. Sen T., and Gupta S.K. A branch and bound procedure to solve a bicriterion scheduling problem. IIE Transactions 15 (1983) 84-88
30. Smith W.E. Various optimizers for single stage production. Naval Research Logistics Quarterly 3 (1956) 1-2
31. Steiner G., and Stephenson P. Pareto optimal for total weighted completion time and maximum lateness on a single machine. Discrete Applied Mathematics 155 (2007) 2341-2354
32. T'kindt V., and Billaut J.-C. Some guidelines to solve multicriteria scheduling problems. IEEE International Conference on Systems, Man and Cybernetics Proceeding 6 (1999) 463-468
33. T'kindt V., Bouibede-Hocine K., and Esswein C. Counting and enumeration complexity with application to multicriteria scheduling. Annals of Operations Research 153 (2007) 215-234
34. Toktaş B., Azizoǧlu M., and Köksalan S.K. Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan. European Journal of Operational Research 157 (2004) 286-295
35. Varangharajan T.K., and Rejendran C. A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs. European Journal of Operational Research 167 (2005) 772-795
36. Vilcot G., and Billaut J.C. A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem. European Journal of Operational Research 190 (2008) 398-411
37. Yen B.P.C., and Wan G. Single machine bicriteria scheduling: A survey. International Journal of Industrial Engineering 10 (2003) 222-231