Helper-objective optimization strategies for the Job-Shop Scheduling Problem

Applied Soft Computing Journal

Volumn 11, Issue 6, 2011, Pages 4161-4174

  Lochtefeld, Darrell F ^a   Ciarallo, Frank W ^b  

^a AIR FORCE RESEARCH LABORATORY   (United States)

^b WRIGHT STATE UNIVERSITY   (United States)

Author keywords

Epistasis; Helper Objective; Job Shop Scheduling Problem (JSSP); Multi objectivization

Indexed keywords

COMPUTATIONAL RESULTS; EPISTASIS; HELPER-OBJECTIVE; JOB SHOP SCHEDULING PROBLEM (JSSP); JOB SHOP SCHEDULING PROBLEMS; MULTI-OBJECTIVIZATION; MULTIPLE OBJECTIVES; OPTIMIZATION STRATEGY; PROBLEM-SPECIFIC KNOWLEDGE; SEARCH PROCESS; SEARCH QUALITY; SIMILAR SOLUTION; SINGLE-OBJECTIVE GENETIC ALGORITHMS; SOLUTION SPACE;

GENETIC ALGORITHMS;

OPTIMIZATION;

EID: 79956125288     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2011.03.007     Document Type: Article

References (38)

1. M.T. Jensen Helper-objectives: using multi-objective evolutionary algorithms for single-objective optimisation J. Math. Model. Algorithms 3 2004 323 347 (Pubitemid 40317582)
2. M.R. Garey, D.S. Johnson, and R. Sethi The complexity of flowshop and jobshop scheduling Math. Oper. Res. 1 1976 117 129
3. R.J.M. Vaessens, E.H.L. Aarts, and J.K. Lenstra Job shop scheduling by local search INFORMS J. Comput. 8 1996 302 317 (Pubitemid 126681519)
4. M.T. Jensen Guiding single-objective optimization using multi-objective methods Proceedings of the 2003 International Conference on Applications of Evolutionary Computing, Lecture Notes in Computer Science 2003 Springer 268 279
5. A.E. Eiben, and J.E. Smith Introduction to Evolutionary Computing 2003 Springer
6. C.A. Coello Coello, G.B. Lamont, and D.A. Van Veldhuisen Evolutionary Algorithms for Solving Multi-objective Problems 2nd ed. 2007 Springer New York
7. J.D. Knowles, R.A. Watson, and D.W. Corne Reducing local optima in single-objective problems by multi-objectivization Proceedings of the First International Conference on Evolutionary Multi-criterion Optimization, Lecture Notes in Computer Science 2001 269 283 (Pubitemid 33241393)
8. J. Handl, S. Lovell, and J. Knowles Multiobjectivization by decomposition of scalar cost functions Proceedings of the 10th International Conference on Parallel Problem Solving from Nature: PPSN X, Lecture Notes in Computer Science 2008 Springer 31 40
9. E.L. Lawler, and D.E. Wood Branch-and-bound methods: a survey Oper. Res. 14 1966 699 719
10. H.A. Abbass, and K. Deb Searching under multi-evolutionary pressures Proceedings of the 3rd International Conference on Evolutionary Multi-Criterion Optimization, Lecture Notes in Computer Science 2003 Springer pp. 391-404
11. F. Neumann, and I. Wegener Can single-objective optimization profit from multiobjective optimization? Multiobjective Problem Solving from Nature: From Concepts to Applications 2007 Springer pp. 115-130
12. D. Brockhoff, T. Friedrich, N. Hebbinghaus, C. Klein, F. Neumann, and E. Zitzler Do additional objectives make a problem harder? Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, A.C.M 2007 765 772 (Pubitemid 47291614)
13. D. Greiner, J.M. Emperador, G. Winter, and B. Galván Improving computational mechanics optimum design using helper objectives: an application in frame bar structures Proceedings of the 4th International Conference on Evolutionary Multi-criterion Optimization, Lecture Notes in Computer Science 2007 Springer 575 589 (Pubitemid 350270912)
14. M. Jahne, X. Li, and J. Branke Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2009) A.C.M Evolutionary algorithms and multi-objectivization for the travelling salesman problem 2009 595 602
15. M. Wright Subcost-guided search - experiments with timetabling problems J. Heuristics 7 2001 251 260 (Pubitemid 32517558)
16. D.E. Goldberg Genetic algorithms and Walsh functions. Part I. A gentle introduction Complex Syst. 3 1989 129 152
17. D Beasley, R.R. Martin, and D.R. Bull An overview of genetic algorithms. Part 1. Fundamentals Univ. Comput. 15 1993 58
18. Y. Davidor Epistasis variance: a viewpoint on GA-hardness Anonymous Foundations of Genetic Algorithms - 1 1991 Morgan Kaufmann San Mateo, CA pp. 23-35
19. H. Van Hove, and A. Verschoren On epistasis Comput. Artif. Intell. 14 1994 271 277
20. D. Suys, and A. Verschoren Extreme epistasis Proceedings of the International Conference on Intelligent Technologies in Human-Related Sciences (ITHURS'96) 1996 251 258
21. B. Naudts, D. Suys, and A. Verschoren Generalized royal road functions and their epistasis Comput. Artif. Intell. 19 2000 317 334
22. C.R. Reeves, and C.C. Wright Epistasis in genetic algorithms: an experimental design perspective Proceedings of the 6th International Conference on Genetic Algorithms 1995 Morgan Kaufmann 217 224
23. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan A fast and elitist multiobjective genetic algorithm: NSGA-II IEEE Trans. Evol. Comp. 6 2002 182 197 (Pubitemid 34555372)
24. E. Zitzler, M. Laumanns, and L. Thiele SPEA2: improving the strength Pareto evolutionary algorithm Proceedings of EUROGEN 2001 95 100
25. D.W. Corne, N.R. Jerram, J.D. Knowles, and M.J. Oates PESA-II: region-based selection in evolutionary multiobjective optimization Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), A.C.M. 2001 283 290
26. J. Knowles, and D. Corne The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation Proceedings of the Congress on Evolutionary Computation (CEC99) 1999 Morgan Kaufmann 98 105
27. R. Cheng, M. Gen, and Y. Tsujimura A tutorial survey of job-shop scheduling problems using genetic algorithms. Part II. Hybrid genetic search strategies Comput. Indus. Eng. 36 1999 343 364
28. B. Giffler, and G. Thompson Algorithms for solving production-scheduling problems Oper. Res. 1960 487 503
29. C. Bierwirth A generalized permutation approach to job shop scheduling with genetic algorithms OR Spectrum 17 1995 87 92
30. S. Lawrence, Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement) (1984).
31. R.H. Storer, S.D. Wu, and R. Vaccari New search spaces for sequencing problems with application to job shop scheduling Manage. Sci. 38 1992 1495 1509 (Pubitemid 23633245)
32. J.E. Beasley OR-library: distributing test problems by electronic mail J. Oper. Res. 41 1990 1069 1072 http://people.brunel.ac.uk/∼mastjjb/jeb/info. html
33. W.J. Hopp, and M.L. Spearman Factory Physics 2nd ed. 2001 Irwin/McGraw-Hill Boston, MA
34. D.F. Lochtefeld, and F.W. Ciarallo Deterministic helper-objective sequence applied to the job-shop scheduling problem Proceedings of the Genetic, Evolutionary Computation Conference (GECCO-2010) A.C.M 2010 431 438
35. J.J. Grefenstette Deception considered harmful Foundations of Genetic Algorithms - 2 1993 Morgan Kaufmann San Francisco pp. 75-91
36. J.N. Hooker Needed: an empirical science of algorithms Oper. Res. 42 1994 201 212
37. M.T. Iglesias, V.S. PeNAranda, C. Vidal, and A. Verschoren Higher epistasis in genetic algorithms Bull. Aust. Math. Soc. 77 2008 225 243
38. T. Weise, S. Niemczyk, H. Skubch, R. Reichle, and K. Geihs A tunable model for multi-objective, epistatic, rugged, neutral fitness landscapes Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2008) A.C.M 2008 795 802