Heuristic approach to bicriteria scheduling

Naval Research Logistics

Volumn 46, Issue 7, 1999, Pages 777-789

  Köksalan, M Murat ^a  

^a MIDDLE EAST TECHNICAL UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; SCHEDULING;

BICRITERIA SCHEDULING;

JOB ANALYSIS;

EID: 0344183121     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199910)46:7<777::AID-NAV2>3.0.CO;2-5     Document Type: Article

References (19)

1. M.L. Fisher, A dual algorithm for the one machine scheduling problem, Math Program 11 (1976), 229-251.
2. T. Fry, R. Armstrong, and H. Lewis, A framework for single machine multiple objective scheduling research, Omega 17 (1989), 595-607.
3. H. Heck and S. Roberts, A note on the extension of a result on scheduling with secondary criteria, Nav Res Logistics Quart 19 (1972), 403-405.
4. J.A. Hoogeveen, Single machine bicriteria scheduling, Ph.D. Thesis, CWI, Amsterdam, 1992.
5. J.A. Hoogeveen and S.L. Van de Velde, Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time, Oper Res Lett 17 (1995), 205-208.
6. R.J.W. James, Using tabu search to solve the common due date early/tardy machine scheduling problem, Comput Oper Res 24 (1997), 199-208.
7. R.L. Keeney and H. Raiffa, Decisions with multiple objectives, Wiley, New York, 1976.
8. S. Kondakci, M. Azizoglu, and M. Köksalan, Scheduling with multiple criteria, Proc Tenth Int Conf Multiple Criteria Decision Making, 1992, Vol. 3, pp. 19-27.
9. M.M. Köksalan, Identifying and ranking a most preferred subset of alternatives in the presence of multiple criteria, Nav Res Logistics 36 (1989), 359-372.
10. M.M. Köksalan, M. Azizoglu, and S. Kondakci, Minimizing flowtime and maximum earliness on a single machine, IIE Trans 30 (1998), 192-200.
11. E. Koktener and M.M. Köksalan, A simulated annealing approach to bicriteria scheduling problems on a single machine, J Heuristics (1999), in press.
12. J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker, Complexity of machine scheduling problems, Ann Discrete Math 1 (1977), 343-362.
13. C. Liao, R. Huang, and S. Tseng, Use of a variable range in solving multiple criteria scheduling problems, Comput Oper Res 19 (1992), 453-460.
14. A. Nagar, J. Haddock, and S. Heragu, Multiple and bicriteria scheduling: A literature survey, Eur J Oper Res 81 (1995), 88-104.
15. R.N. Nepalli, C. Chen, and J.N.D. Gupta, Genetic algorithms for the two-stage bicriteria flowshop problem, Eur J Oper Res 95 (1996), 356-373.
16. T. Sen and S.K. Gupta, A branch and bound procedure to solve a bicriterion scheduling problem, IIE Trans 15 (1983), 84-88.
17. W.E. Smith, Various optimizers for single stage production, Nav Res Logistics Quart 3 (1956), 59-66.
18. L.N. Van Wassenhove and F. Gelders, Solving a bicriterion scheduling problem, Eur J Oper Res 4 (1980), 42-48.
19. M. Zeleny, Multiple criteria decision making, McGraw-Hill, New York, 1982.