A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates

4OR

Volumn 2, Issue 2, 2004, Pages 129-147

  Sevaux, Marc ^a   Sörensen, Kenneth ^b  

^a UNIVERSITÉ DE VALENCIENNES   (France)

^b UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

Genetic algorithm; Quality robustness; Single machine scheduling; Solution robustness; Weighted number of late jobs

Indexed keywords

EID: 84891655644     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-003-0028-0     Document Type: Article

References (31)

1. 4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Operations Research Letters 24: 175-180.
2. Baptiste P, Péridy L, Pinson E (2003) A branch and bound to minimize the number of late jobs on a single machine with release time constraints. European Journal of Operational Research 144: 1-11.
3. Branke J (1998) Creating robust solutions by means of evolutionary algorithms. In: Parallel Problem Solving from Nature V (LNCS, vol. 1498). Springer, Berlin Heidelberg NewYork, pp 119-128.
4. Branke J (2001) Reducing the sampling variance when searching for robust solutions. In: Spector L et al. (ed), GECCO 2001-Proceedings of the genetic and evolutionary computation conference. Morgan Kaufmann Publishers, pp 235-242.
5. Christopher M (1998) Logistics and supply chain management-strategies for reducing cost and improving service. Financial Times Prentice Hall, London.
6. Dauzère-Pérès S (1995) Minimizing late jobs in the general one machine scheduling problem. European Journal of Operational Research 81: 134-142.
7. Dauzère-Pérès S, Sevaux M (2003) Using lagrangean relaxation to minimize the weighted number of late jobs. Naval Research Logistics 50 (3): 273-288.
8. Dauzère-Pérès S, Sevaux M (2001) An exact method to minimize the number of late jobs in single machine scheduling. Technical report, Ecole des Mines de Nantes, France, submitted.
9. Davenport AJ, Beck JC (2000) A survey of techniques for scheduling with uncertainty. Unpubl. manuscript.
10. Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. AddisonWesley.
11. Hart E, Ross P (1999a) The evolution and analysis of a potential antibody library for job-shop scheduling. In: Corne D, Dorigo M, Glover F (eds) New ideas in optimization. London, McGraw Hill, pp 185-202.
12. Hart E, Ross P (1999b) An immune system approach to scheduling in changing environments. In: GECCO 99. Proceedings of the genetic and evolutionary computation conference. Morgan Kaufmann publishers, pp 1559-1566.
13. Herroelen W, Leus R (2002) Project scheduling under uncertainty-survey and research potentials. Invited paper to be published in the special issue of EJOR containing selected papers from PMS2002.
14. Holland JH (1975)Adaptation in natural and artificial systems. Technical report, University of Michigan, Ann Arbor, USA Jensen MT Robust and flexible scheduling with evolutionary computation. PhD thesis, University of Aarhus, Department of Computer Science, Denmark.
15. Kouvelis P, Yu G (1997) Robust discrete optimisation and its applications. (Nonconvex Optimization and its Applications, vol. 14). Kluwer Academic Publishers, Dordrecht.
16. Lenstra JK, Rinnooy KanAHG, Brucker P (1977) Complexity of machine scheduling problems. Annals of Discrete Mathematics 1: 343-362.
17. LeonVJ, Wu SD, StorerRH (1993) Robust scheduling and game-theoretic control for short-term scheduling of job-shops. In: Fandel G, Gulledge T, JonesA (eds) Operations research in production planning and control. Springer, Berlin Heidelberg NewYork, pp 321-335.
18. Leon VJ, Wu SD, Storer RH (1994a) A game-theoretic control approach for job shops in the presence of disruptions. International Journal of Production Research 32 (6): 1451-1476.
19. Leon VJ, Wu SD, Storer RH (1994b) Robustness measures and robust scheduling for job shops. IIE Transactions 26: 32-43.
20. Levenshtein VI (1966) Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics-Doklady 10: 707-710.
21. Portmann MC (1996) Genetic algorithm and scheduling: a state of the art and some propositions. In: Proceedings of the workshop on production planning and control. Mons, Belgium, pp I-XIV.
22. Reeves CR (ed) (1993) Modern heuristic techniques for combinatorial problems. Wiley, NewYork.
23. Reeves CR (1997) Genetic algorithms for the operations researcher. Informs Journal on Computing 9 (3): 231-250.
24. Sevaux M, Dauzère-Pérès S (2002) Genetic algorithms to minimize the weighted number of late jobs on a single machine. European Journal of Operational Research (forthcoming).
25. th metaheuristics international conference. Porto, Portugal, pp 707-712.
26. Tsutsui S (1999) A comparative study on the effects of adding perturbations to phenotypic parameters in genetic algorithms with a robust solution searching scheme. In: Proceedings of the 1999 IEEE systems, man, and cybernetics conference (SMC'99 Tokyo). pp III-585-591.
27. Tsutsui S, GhoshA (1997) Genetic algorithms with a robust solution searching scheme. IEEE Transactions on Evolutionary Computation 1: 201-208.
28. Tsutsui S, Ghosh A, FujimotoY (1996)A robust solution searching scheme in genetic search. In: Voigt HM, Ebeling W, Rechenberg I, Schwefel HP (eds) Parallel problem solving from nature-PPSN IV, vol. 10. Springer, Berlin Heidelberg NewYork, pp 543-552.
29. Tsutsui S, Jain JC (1998) Properties of robust solution searching in multi-dimensional space with genetic algorithms. In: Proceedings of the 2nd International Conference on knowledge-based electronic systems (KES-98).
30. Ukkonen E (1985) Finding approximate patterns in strings. Journal of Algorithms 6: 132-137.
31. Wagner RA, FischerMJ (1974) The string-to-string correction problem. Journal of theACM 21: 168-173.