A genetic algorithm for dynamic advanced planning and scheduling (DAPS) with a frozen interval

This paper investigates a dynamic advanced planning and scheduling (DAPS) problem where new orders arrive on a continuous basis. A periodic policy with a frozen interval is adopted to increase stability on the shop floor. A genetic algorithm is developed to find a schedule such that both production idle time and penalties on tardiness and earliness of both original orders and new orders are minimized at each rescheduling point. The proposed methodology is tested on a series of examples. A representative example is illustrated to indicate that the suggested approach can improve the schedule stability while retaining efficiency.

[1]  Neng-Pai Lin,et al.  The effects of environmental factors on the design of master production scheduling systems , 1994 .

[2]  Shi-Chung Chang,et al.  Scheduling flexible flow shops with no setup effects , 1994, IEEE Trans. Robotics Autom..

[3]  C. Moon *,et al.  Advanced planning and scheduling based on precedence and resource constraints for e-plant chains , 2004 .

[4]  Chiung Moon,et al.  Advanced planning and scheduling with outsourcing in manufacturing supply chain , 2002 .

[5]  James C. Bean,et al.  Matchup Scheduling with Multiple Resources, Release Dates and Disruptions , 1991, Oper. Res..

[6]  Jeffrey W. Herrmann,et al.  Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Methods , 2003, J. Sched..

[7]  Christian Bierwirth,et al.  Production Scheduling and Rescheduling with Genetic Algorithms , 1999, Evolutionary Computation.

[8]  Yeong-Dae Kim,et al.  Simulated annealing and genetic algorithms for scheduling products with multi-level product structure , 1996, Comput. Oper. Res..

[9]  Chris N. Potts,et al.  Rescheduling for New Orders , 2004, Oper. Res..

[10]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[11]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms: Part II. Hybrid , 1999 .

[12]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .

[13]  James C. Bean,et al.  A Genetic Algorithm for the Multiple-Choice Integer Program , 1997, Oper. Res..

[14]  Ihsan Sabuncuoglu,et al.  Analysis of reactive scheduling problems in a job shop environment , 2000, Eur. J. Oper. Res..

[15]  J. Sun,et al.  A dynamic reactive scheduling mechanism for responding to changes of production orders and manufacturing resources , 2001, Comput. Ind..

[16]  William G. Ferrell,et al.  Dynamic rescheduling that simultaneously considers efficiency and stability , 2004, Comput. Ind. Eng..

[17]  Pei-Chann Chang,et al.  One-machine rescheduling heuristics with efficiency and stability as criteria , 1993, Comput. Oper. Res..

[18]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[19]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[20]  Dipak Chaudhuri,et al.  Dynamic scheduling—a survey of research , 1993 .

[21]  Parag C. Pendharkar,et al.  A computational study on design and performance issues of multi-agent intelligent systems for dynamic scheduling environments , 1999 .