Using genetic algorithms for single-machine bicriteria scheduling problems

European Journal of Operational Research

Volumn 145, Issue 3, 2003, Pages 543-556

  Köksalan, Murat ^a   Keha, Ahmet Burak ^a,b  

^a MIDDLE EAST TECHNICAL UNIVERSITY   (Turkey)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Bicriteria scheduling; Genetic algorithms

Indexed keywords

APPROXIMATION THEORY; GENETIC ALGORITHMS; HEURISTIC METHODS; SCHEDULING;

DISCRETE OPTIMIZATION;

OPERATIONS RESEARCH;

EID: 0037448810     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00220-5     Document Type: Article

References (23)

1. Aytaç, A., 1998. A genetic algorithm for bicriteria scheduling. M.S. Thesis, METU, Ankara.
2. Bean J.C. Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing. 6(2):1994;154-160.
3. Chen C.L., Bulfin R.L. Complexity of single machine multi-criteria scheduling problems. European Journal of Operational Research. 70:1993;115-125.
4. Chen C., Vempati V.S., Aljaber N. An Application of genetic algorithms for flow shop problems. European Journal of Operational Research. 80:1995;389-396.
5. Cheng R., Gen M., Tsujimura Y. A tutorial survey of job shop scheduling problems using genetic algorithms - I: Representation. Computers and Industrial Engineering. 30(4):1996;983-997.
6. Gupta M.C., Gupta A., Kumar A. Minimizing flow time variance in a single machine system using genetic algorithms. European Journal of Operational Research. 70:1993;289-303.
7. Hoogeveen, J.A., 1992. Single machine bicriteria scheduling. Ph.D. Thesis, CWI, Amsterdam.
8. Kiran A.S., Unal A.T. A single-machine problem with multiple criteria. Naval Research Logistics. 38:1991;721-727.
9. Köksalan M., Azizoglu M., Kondakci S. Minimizing flowtime and maximum earliness on a single machine. IIE Transactions. 30:1998;192-200.
10. Koktener E., Köksalan M. A simulated annealing approach to bicriteria scheduling problems on a single machine. Journal of Heuristics. 6:2000;311-327.
11. Law A.M., Kelton W.D. Simulation Modeling and Analysis. second ed. 1991;McGraw-Hill Inc. New York.
12. Lee C.Y., Vairaktarakis G.L. Complexity of single machine hierarchical scheduling: A survey. Pardalos P.M. Complexity in Numerical Optimization. 1993;World Scientific Publishing Co. Singapore.
13. Lenstra J.K., Kan A.H.G., Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics. 1:1977;343-362.
14. Mendenhall W., Sincich T. A Second Course in Statistics: Regression Analysis. 1996;Prentice-Hall, London.
15. Moore J.M. A n-job one machine sequencing algorithm for minimizing the number of late jobs. Management Science. 15(Iss.1):1968;102-109.
16. Muhlenbein H. Genetic algorithms. Aaarts E., Lenstra J.K. Local Search in Combinatorial Optimization. 1997;Wiley, New York.
17. Murata T., Ishibuchi H., Tanaka H. Genetic algorithms for flowshop scheduling problems. Computers and Industrial Engineering. 30(4):1996a;1061-1071.
18. Murata T., Ishibuchi H., Tanaka H. Multi-objective genetic algorithm and its applications to flow shop scheduling. Computers and Industrial Engineering. 30(4):1996b;957-968.
19. Nagar A., Haddock J., Heragu S. Multiple and bicriteria scheduling: A literature survey. European Journal of Operations Research. 81:1995;88-104.
20. Nepalli V.R., Chen C.L., Gupta J.N.D. Genetic algorithms for the two-stage bicriteria flowshop problem. European Journal of Operations Research. 95:1996;356-373.
21. Reeves C.R. 1993. Genetic algorithms. Reeves C.R. (Ed.), Modern Heuristics Techniques for Combinatorial Problems. 1993;Halsted Press, New York.
22. T'kindt V., Billaut J.-C. Some guidelines to solve multicriteria scheduling problems. IEEE International Conference on Systems, Man and Cybernetics Proceedings. vol. 6:1999;463-468.
23. Walker A.J. An efficient method for generating discrete random variables with general distributions. Assoc. Comput. Mach. Trans. Math. Software. 3:1977;253-256.