Genetic algorithms and simulated annealing for scheduling in agile manufacturing

References

• Blazewicz , J , Dror , M and Weglarz , J . 1991 . Mathematical programming formulations for machine scheduling: a survey . Euro. J. Oper. Res. , 51 : 283 – 300 .
   Web of Science ®Google Scholar
• Boothroyd G Assembly Automation and Product Design 1992 Marcel Dekker NY
   Google Scholar
• Cheng , R , Gen , M and Tsujimura , Y . 1996 . A tutorial survey of job-shop scheduling problems using genetic algorithms: Part i. Representation . Comput. Indust. Eng. , 30 : 983 – 997 .
   Web of Science ®Google Scholar
• Cheng , R , Gen , M and Tsujimura , Y . 1999 . A tutorial survey of job-shop scheduling problems using genetic algorithms: Part ii: Hybrid genetic search strategies . Comput. Indust. Eng. , 36 : 343 – 364 .
   Web of Science ®Google Scholar
• Doctor , SR , Cavalier , TM and Egbelu , PJ . 1993 . Scheduling for machining and assembly in a job-shop environment . Int. J. Prod. Res. , 31 : 1275 – 1297 .
   Web of Science ®Google Scholar
• Goldberg DE Genetic Algorithms in Search, Optimization, and Machine Learning 1989 Addison-Wesley Reading MA
   Google Scholar
• He , D , Babayan , A and Kusiak , A . 2001 . Scheduling manufacturing systems in an agile environment . Robot. Comput. Integ. Manuf. , 17 : 2461 – 2481 .
   Google Scholar
• He , D and Babayan , A . 2002 . Scheduling manufacturing systems for delayed product differentiation in agile manufacturing . Int. J. Prod. Res. , 40 : 2461 – 2481 .
   Web of Science ®Google Scholar
• He , DW and Kusiak , A . 1998 . Designing an assembly line for modular products . Comput. Indust. Eng. , 34 : 37 – 52 .
   Google Scholar
• Holland JH Adaptation in Natural and Artificial Systems 1975 The University in Michigan Press Ann Arbor Michigan
   Google Scholar
• Ishibuchi , H , Misaki , S and Tanaka , H . 1995 . Modified simulated annealing algorithms for the flow shop sequencing problem . Euro. J. Oper. Res. , 81 : 388 – 398 .
   Web of Science ®Google Scholar
• Khoo , LP , Lee , SG and Yin , XF . 2000 . A prototype genetic algorithm-enhanced multi-objective scheduler for manufacturing systems . Int. J. Adv. Manuf. Tech. , 16 : 131 – 138 .
   Google Scholar
• Khoo , LP and Loi , MY . 2002 . A tabu-enhanced genetic algorithm approach to agile manufacturing . Int. J. Adv. Manuf. Tech. , 20 : 692 – 700 .
   Web of Science ®Google Scholar
• Kim , J-U and Kim , Y-D . 1996 . Simulated annealing and genetic algorithms for scheduling products with multi-level product structure . Comput. Oper. Res. , 23 : 857 – 868 .
   Web of Science ®Google Scholar
• Kusiak , A . 1989 . Aggregate scheduling of a flexible machining and assembly system . IEEE Trans. Robot. Auto. , 5 : 451 – 459 .
   Google Scholar
• Kusiak A Computational Intelligence in Design and Manufacturing 2000 John Wiley & Sons, Inc. New York
   Google Scholar
• Lee , C-Y and Vairaktarakis , GL . 1998 . Performance comparison of some classes of flexible flow shops and job shops . Int. J. Flex. Manuf. Systems , 10 : 379 – 405 .
   Google Scholar
• Michalewicz Z Genetic Algorithms + Data Structures = Evolution Programs 1992 Springer-Verlag Berlin
   Google Scholar
• Mohanasundaram , KM , Natarajan , K , Viswanathkumar , G , Radhakrishnan , P and Rajendran , C . 2002 . Scheduling rules for dynamic shops that manufacture multi-level jobs . Comput. Indust. Eng. , 44 : 119 – 131 .
   Web of Science ®Google Scholar
• Montgomery D Design and Analysis of Experiments 5th edn 2001 John Wiley & Sons, Inc. New York
   Google Scholar
• Negenman , EG . 2001 . Local search algorithms for the multiprocessor flow shop scheduling problem . Euro. J. Oper. Res. , 128 : 147 – 158 .
   Google Scholar
• Nepalli , VR , Chen , C-L and Gupta , JND . 1996 . Genetic algorithms for the two-stage bicriteria flowshop problem . Euro. J. Oper. Res. , 95 : 356 – 373 .
   Google Scholar
• Pongcharoen , P , Hicks , C , Braiden , PM and Stewardson , DJ . 2002 . Determining optimum genetic algorithm parameters for scheduling the manufacturing and assembly of complex products . Int. J. Prod. Econ. , 78 : 311 – 322 .
   Web of Science ®Google Scholar
• Portman , M-C , Vignier , A , Dardilhac , D and Dezalay , D . 1998 . Branch and bound crossed with GA to solve hybrid flowshops . Euro. J. Oper. Res. , 107 : 389 – 400 .
   Web of Science ®Google Scholar
• Reeves , CR . 1995 . A genetic algorithm for flowshop sequencing . Comput. Oper. Res. , 22 : 5 – 13 .
   Web of Science ®Google Scholar
• Sawik T Production Planning and Scheduling in Flexible Assembly Systems 1999 Springer Berlin Germany
   Google Scholar
• Shi , G . 1997 . A genetic algorithm applied to a classic job-shop scheduling problem . Int. J. Syst. Sci. , 28 : 25 – 32 .
   Web of Science ®Google Scholar
• Stat-Ease, Design-Expert® software. Version 6 2001 @www.stat-ease.com
   Google Scholar
• Sun , X , Morizawa , K and Nagasawa , H . 2003 . Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling . Euro. J. Oper. Res. , 146 : 498 – 516 .
   Web of Science ®Google Scholar
• The Mathworks, Inc. MATLAB® software. Version 6.1 2001
   Google Scholar
• Tian , P , Ma , J and Zhang , D-M . 1999 . Application of the simulated annealing to the combinatorial optimization problem with permutation property: an investigation of generation mechanism . Euro. J. Oper. Res. , 118 : 356 – 373 .
   Google Scholar
• Wang , L and Zheng , D-Z . 2001 . An effective hybrid optimization strategy for job-shop scheduling problems . Comput. Oper. Res. , 28 : 585 – 596 .
   Web of Science ®Google Scholar
• Wang , L and Zheng , D-Z . 2002 . A modified genetic algorithm for job shop scheduling . Int. J. Adv. Manuf. Tech. , 20 : 72 – 76 .
   Google Scholar
• Wang , L and Zheng , D-Z . 2003 . An effective hybrid heuristic for flow shop scheduling . Int. J. Adv. Manuf. Tech. , 21 : 38 – 44 .
   Web of Science ®Google Scholar
• Yokoyama , M . 2001 . Hybrid flow-shop scheduling with assembly operations . Int. J. Prod. Econ. , 73 : 103 – 116 .
   Web of Science ®Google Scholar
• Yoon , S-H and Ventura , JA . 2002 . An application of genetic algorithms to lot-streaming flow shop scheduling . IIE Trans. , 34 : 779 – 787 .
   Web of Science ®Google Scholar
• Zegordi , SH , Itoh , K and Enkawa , T . 1995 . Minimizing the makespan for flow shop scheduling by combining simulated annealing with sequence knowledge . Euro. J. Oper. Res. , 85 : 515 – 531 .
   Web of Science ®Google Scholar