Network modeling and evolutionary optimization for scheduling in manufacturing

Scheduling is one of the most important fields in Advanced Planning and Scheduling or a manufacturing optimization. In this paper, we propose a network modeling technique to formulate the complex scheduling problems in manufacturing, and focus on how to model the scheduling problems to mathematical formulation. We propose a multi-section evolutionary algorithm for the scheduling models formulated by network modeling. Through a combination of the network modeling and this multi-section evolutionary algorithm, we can implement the auto-scheduling in the manufacturing system. The effectiveness and efficiency of proposed approach are investigated with various scales of scheduling problems by comparing with recent related researches. Lastly, we introduced service-oriented evolutionary computation architecture software. It help improved the evolutionary computation’s availability in the variable practical scheduling in manufacturing.

[1]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[2]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[3]  Omar López-Ortega,et al.  A STEP-based manufacturing information system to share flexible manufacturing resources data , 2005, J. Intell. Manuf..

[4]  Shengxiang Yang,et al.  Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling , 2000, IEEE Trans. Neural Networks Learn. Syst..

[5]  Eugeniusz Nowicki,et al.  An Advanced Tabu Search Algorithm for the Job Shop Problem , 2005, J. Sched..

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

[7]  Christian Prins,et al.  A memetic algorithm with dynamic population management for an integrated production-distribution problem , 2009, Eur. J. Oper. Res..

[8]  Zhi-Long Chen,et al.  Machine scheduling with transportation considerations , 2001 .

[9]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[10]  B. RAA,et al.  A robust dynamic planning strategy for lot-sizing problems with stochastic demands , 2005, J. Intell. Manuf..

[11]  N.M. Najid,et al.  A modified simulated annealing method for flexible job shop scheduling problem , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[12]  Pierre Borne,et al.  Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[13]  Christodoulos A. Floudas,et al.  Mixed Integer Linear Programming in Process Scheduling: Modeling, Algorithms, and Applications , 2005, Ann. Oper. Res..

[14]  Mitsuo Gen,et al.  Auto-tuning strategy for evolutionary algorithms: balancing between exploration and exploitation , 2008, Soft Comput..

[15]  J. Christopher Beck,et al.  A theoretic and practical framework for scheduling in a stochastic environment , 2009, J. Sched..

[16]  Ameur Soukhal,et al.  Complexity of flow shop scheduling problems with transportation constraints , 2005, Eur. J. Oper. Res..

[17]  Hark Hwang,et al.  Network model and effective evolutionary approach for AGV dispatching in manufacturing system , 2006, J. Intell. Manuf..

[18]  Mitsuo Gen,et al.  Evolutionary techniques for optimization problems in integrated manufacturing system: State-of-the-art-survey , 2009, Comput. Ind. Eng..

[19]  Chen-Fu Chien,et al.  Modeling semiconductor testing job scheduling and dynamic testing machine configuration , 2008, Expert Syst. Appl..

[20]  Mitsuo Gen,et al.  Integrated data structure and scheduling approach for manufacturing and transportation using hybrid genetic algorithm , 2006, J. Intell. Manuf..

[21]  Ching-Chin Chern,et al.  Heuristic factory planning algorithm for advanced planning and scheduling , 2009, Comput. Oper. Res..

[22]  Thomas Erl,et al.  Service-Oriented Architecture: Concepts, Technology, and Design , 2005 .

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

[24]  Zuobao Wu,et al.  Multiagent scheduling method with earliness and tardiness objectives in flexible job shops , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[25]  Jesuk Ko,et al.  A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling , 2003, Comput. Oper. Res..

[26]  Amir Azaron,et al.  A hybrid method for solving stochastic job shop scheduling problems , 2005, Appl. Math. Comput..

[27]  GenMitsuo,et al.  Evolutionary techniques for optimization problems in integrated manufacturing system , 2009 .

[28]  Charles V. Stewart,et al.  Reducing the search time of a steady state genetic algorithm using the immigration operator , 1991, [Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91.

[29]  Paolo Brandimarte,et al.  Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..

[30]  Bernard Grabot,et al.  Dispatching rules in scheduling Dispatching rules in scheduling: a fuzzy approach , 1994 .

[31]  Kenn Steger-Jensen,et al.  Advanced Planning and Scheduling , 2008 .

[32]  Mitsuo Gen,et al.  Network Models and Optimization: Multiobjective Genetic Algorithm Approach , 2008 .

[33]  Peter Brucker,et al.  Job-shop scheduling with multi-purpose machines , 1991, Computing.

[34]  Nicolas Jonard,et al.  A genetic algorithm to solve the general multi-level lot-sizing problem with time-varying costs , 2000 .

[35]  Behrokh Khoshnevis,et al.  A linearized polynomial mixed integer programming model for the integration of process planning and scheduling , 2004, J. Intell. Manuf..

[36]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..

[37]  Behrokh Khoshnevis,et al.  Integration of process planning and scheduling— a review , 2000, J. Intell. Manuf..

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

[39]  Christodoulos A. Floudas,et al.  Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review , 2004, Comput. Chem. Eng..

[40]  Mitsuo Gen,et al.  Priority-Based Genetic Algorithm for Shortest Path Routing Problem in OSPF , 2009 .

[41]  Nidhal Rezg,et al.  An integrated greedy heuristic for a flexible job shop scheduling problem , 2001, 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236).

[42]  Peter M. Verderame,et al.  Integrated Operational Planning and Medium-Term Scheduling for Large-Scale Industrial Batch Plants , 2008 .

[43]  Mitsuo Gen,et al.  Multistage-Based Genetic Algorithm for Flexible Job-Shop Scheduling Problem , 2009 .