An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem

Baker, 1985, Adaptive selection methods for genetic algorithms, 101 J.W. Barnes, J.B. Chambers, Flexible job shop scheduling by tabu search, Graduate Program in Operations Research and Industrial Engineering, Technical Report Series ORP96-09, The University of Texas at Austin, 1996. A.M. Barroso, J.R.A. Torreau, J.C.B. Leite, O.G. Loques, J.S. Fraga, A new technique for task allocation in real-time distributed systems, in: Proceedings of the 7th Brasilian Symposium of Fault Tolerant Computers, Campina Grande, Brazil, 1997, pp. 269–278. Baykasoglu, 2002, Linguistic-based meta-heuristic optimization model for flexible job shop scheduling, International Journal of Production Research, 40, 4523, 10.1080/00207540210147043 Beasley, 1993, An overview of genetic algorithms: Part 1, Fundamentals, University Computing, 15, 58 Brandimarte, 1993, Routing and scheduling in a flexible job shop by tabu search, Annals of Operations Research, 22, 158 Chan, 2006, Solving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach, Robotics and Computer-Integrated Manufacturing, 22, 493, 10.1016/j.rcim.2005.11.005 Chan, 2005, An adaptive genetic algorithm with dominated genes for distributed scheduling problems, Expert Systems with Applications, 29, 364, 10.1016/j.eswa.2005.04.009 Chan, 2006, Application of genetic algorithms with dominated genes in a distributed scheduling problem in flexible manufacturing, International Journal of Production Research, 44, 523, 10.1080/00207540500319229 H. Chen, J. Ihlow, C. Lehmann, A genetic algorithm for flexible job-shop scheduling, in: IEEE International Conference on Robotics and Automation, Detroit, Michigan, 1999, pp. 1120–1125. Choi, 2002, A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups, Computers and Industrial Engineering Archive, 42, 43, 10.1016/S0360-8352(02)00002-5 Cicirello, 2004, Wasp-like agents for distributed factory coordination, Autonomous Agents and Multi-Agent Systems, 8, 237, 10.1023/B:AGNT.0000018807.12771.60 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 M. Di Natale, J.A. Stankovic, Applicability of simulated annealing methods to real time scheduling and jitter control, in: Proceedings of the 16th IEEE Real-Time Systems Symposium, Pisa, Italy, 1995, pp. 190–199. Fisher, 1963, Probabilistic learning combinations of local job shop scheduling rules, 225 Garey, 1976, The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research, 1, 117, 10.1287/moor.1.2.117 N.B. Ho, J.C. Tay, GENACE: An efficient cultural algorithm for solving the flexible job-shop problem, in: Proceedings of the IEEE Congress on Evolutionary Computation, 2004, pp. 1759–1766. Hurink, 1994, Tabu search for the job shop scheduling problem with multi-purpose machines, Operations Research Spektrum, 15, 205, 10.1007/BF01719451 Jia, 2003, A modified genetic algorithm for distributed scheduling problems, Journal of Intelligent Manufacturing, 15, 351, 10.1023/A:1024653810491 Kacem, 2002, Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems, IEEE Transactions on Systems, Man and Cybernetics, Part C: Applications and Reviews, 32, 1, 10.1109/TSMCC.2002.1009117 S. Lawrence, Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques, Tech. Report, GSIA, Carnegie Mellon University, Pittsburgh, PA, 1984. Lee, 1994, Scheduling flexible manufacturing systems using Petri nets and heuristic search, IEEE Transactions on Robotics and Automation, 10, 123, 10.1109/70.282537 M. Mastrolilli, <http://www.idsia.ch/~monaldo/fjsp.html>. Mastrolilli, 2000, 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 M. Mastrolilli, L.M. Gambardella, Effective neighbourhood functions for the flexible job shop problem: Appendix, Technical Report, IDSIA – Istituto Dalle Molle di Studi sull’Intelligenza Artificiale, 2000. Electronic version available at: <http://www.idsia.ch/~monaldo/fjsp.html>. Pezzella, 2008, A genetic algorithm for the flexible job-shop scheduling problem, Computers and Operations Research, 35, 3202, 10.1016/j.cor.2007.02.014 Santos, 1997, A realistic approach to the multitask–multiprocessor assignment problem using the empty-slots method and rate-monotonic scheduling, Journal of Real-time Systems, 13, 167, 10.1023/A:1007933607293 M.J. Schniederjans, International Facility Acquisition and Location Analysis, Quorum Books, Westport, 1999. Sule, 1999 Tay, 2004, An effective chromosome representation for evolving flexible job shop schedules, vol. 3103, 210 Tindell, 1992, Allocating hard realtime tasks: A NP-hard problem made easy, Journal of Real-time Systems, 4, 145, 10.1007/BF00365407 R.J.M. Vaessens, E.H.L. Aarts, J. Lenstra, Job shop Scheduling by Local Search, COSOR Memorandum 94-05, Eindhoven University of Technology, 1994. Xia, 2005, An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems, Computers and Industrial Engineering Archive, 48, 409, 10.1016/j.cie.2005.01.018