A genetic algorithm for the Flexible Job-shop Scheduling Problem

Pinedo, 2002

Garey, 1976, The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research, 1, 117, 10.1287/moor.1.2.117

Mastrolilli, 1996, Effective neighbourhood functions for the flexible job shop problem, Journal of Scheduling, 3, 3, 10.1002/(SICI)1099-1425(200001/02)3:1<3::AID-JOS32>3.0.CO;2-Y

Barnes JW, Chambers JB. Flexible Job Shop Scheduling by tabu search. Graduate program in operations research and industrial engineering. Technical Report ORP 9609, University of Texas, Austin; 1996. 〈http://www.cs.utexas.edu/users/jbc/〉.

Chen H, Ihlow J, Lehmann C. A genetic algorithm for flexible Job-shop scheduling. In: IEEE international conference on robotics and automation, Detroit; 1999. p. 1120–5.

Kacem, 2002, Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems, IEEE Transactions on Systems, Man, and Cybernetics, Part C, 32, 1, 10.1109/TSMCC.2002.1009117

Feige U., Scheideler C. Improved bounds for acyclic job shop scheduling. In: Proceedings of the 30th annual ACM symposium on the theory of computing (STOC ’98); 1998. p. 624–33.

Jansen K, Mastrolilli M, Solis-Oba R. Approximation algorithms for Flexible Job Shop Problems. In: Lecture notes in computer science, vol. 1776. Proceedings of the fourth Latin American symposium on theoretical informatics; Berlin: Springer. 2000. p. 68–77.

Brandimarte, 1993, Routing and scheduling in a flexible job shop by tabu search, Annals of Operations Research, 41, 157, 10.1007/BF02023073

Paulli, 1995, A hierarchical approach for the FMS scheduling problem, European Journal of Operational Research, 86, 32, 10.1016/0377-2217(95)00059-Y

Vaessens, 1994

Dauzére-Pérés, 1997, An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search, Annals of Operations Research, 70, 281, 10.1023/A:1018930406487

Hurink, 1994, Tabu search for the job shop scheduling problem with multi-purpose machines, OR-Spektrum, 15, 205, 10.1007/BF01719451

Jia, 2003, A modified genetic algorithm for distributed scheduling problems, International Journal of Intelligent Manufacturing, 14, 351, 10.1023/A:1024653810491

Ho NB, Tay JC. GENACE: an efficient cultural algorithm for solving the Flexible Job-Shop Problem. IEEE international conference on robotics and automation 2004;1759–66.

Tay JC, Wibowo D. An Effective Chromosome Representation for evolving flexible job shop schedules, GECCO 2004. In: Lecture notes in computer science, vol. 3103. Berlin: Springer; 2004. p. 210–21.

Lee, 1998, A genetic algorithm for general machine scheduling problems, International Journal of Knowledge-Based Electronic, 2, 60

Fisher, 1968, Probabilistic learning combinations of local job shop scheduling rules, 225

Lawrence, 1984, An experimental investigation of heuristic scheduling techniques