Flexible Assembly Job-Shop Scheduling With Sequence-Dependent Setup Times and Part Sharing in a Dynamic Environment: Constraint Programming Model, Mixed-Integer Programming Model, and Dispatching Rules

This paper studies the flexible assembly job-shop scheduling problem in a dynamic manufacturing environment, which is an exension of job-shop scheduling with incorporation of serveral types of flexibilies and integration of an assembly stage. Each product is assembled from several parts with nonlinear process plans with operations involving alternative machines. Setup times are sequence dependent and serparately considered from processing times. Part sharing is fully allowed such that they can be used for the assembly of any possible product, rather than being preassociated to a specfic product. We employ constraint programming and mixed-integer linear programming to formulate the problem. Besides, several dispatching rules with machine feedback machanism are developped. Experimental studies are conducted based on test case problems with different scales and complexities. It is found that constraint programming is the most efficacious approach, whose solution fitness outperforms mixed-integer linear programming as well as all dispatching rules in both static and dynamic cases. On the other hand, dispatching rules are simple to implement, among which the “earliest completion time” rule is the most favourable. A real-time scheduling/rescheduling system has been constructed for the implementation of the proposed approaches to solve practical problems in production.

[1]  Fawaz S. Al-Anzi,et al.  A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application , 2006, Comput. Oper. Res..

[2]  Felix T.S. Chan,et al.  Lot streaming for product assembly in job shop environment , 2008 .

[3]  P. Shahabudeen,et al.  Ant Colony Optimization for Multilevel Assembly Job Shop Scheduling , 2008 .

[4]  Chandrasekharan Rajendran,et al.  Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs , 2005, Comput. Ind. Eng..

[5]  Chung-Yee Lee,et al.  Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem , 1993 .

[6]  Chris N. Potts,et al.  The Two-Stage Assembly Scheduling Problem: Complexity and Approximation , 1995, Oper. Res..

[7]  Fawaz S. Al-Anzi,et al.  An artificial immune system heuristic for two-stage multi-machine assembly scheduling problem to minimize total completion time , 2013 .

[8]  George Q. Huang,et al.  Integrating order review/release and dispatching rules for assembly job shop scheduling using a simulation approach , 2011 .

[9]  Felix T. S. Chan,et al.  An evolutionary algorithm for assembly job shop with part sharing , 2009, Comput. Ind. Eng..

[10]  Fawaz S. Al-Anzi,et al.  Better Heuristics for a Two-Stage Multi-Machine Assembly Scheduling Problem to Minimize Total Completion Time , 2012 .

[11]  Felix T. S. Chan,et al.  A resource-constrained assembly job shop scheduling problem with Lot Streaming technique , 2009, Comput. Ind. Eng..

[12]  Mostafa Zandieh,et al.  Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop , 2010, Adv. Eng. Softw..

[13]  Fariborz Jolai,et al.  Mathematical modeling and heuristic approaches to flexible job shop scheduling problems , 2007, J. Intell. Manuf..

[14]  Fawaz S. Al-Anzi,et al.  A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times , 2007, Eur. J. Oper. Res..

[15]  T. C. Wong,et al.  A comparison of hybrid genetic algorithm and hybrid particle swarm optimization to minimize makespan for assembly job shop , 2013, Appl. Soft Comput..

[16]  P. M. Khodke,et al.  Heuristics for production scheduling problem with machining and assembly operations , 2012 .

[17]  Saeid Nourali,et al.  A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR EXIBLE ASSEMBLY JOB SHOP SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT SETUP TIMES , 2014 .

[18]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[19]  Pius J. Egbelu,et al.  SCHEDULING IN A PRODUCTION ENVIRONMENT WITH MULTIPLE PROCESS PLANS PER JOB , 1999 .

[20]  Fawaz S. Al-Anzi,et al.  The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time , 2008 .

[21]  T. Radha Ramanan,et al.  An Investigation of Order Review/Release Policies and Dispatching Rules for Assembly Job Shops with Multi Objective Criteria☆ , 2015 .

[22]  Masao Yokoyama,et al.  Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times , 2005, Eur. J. Oper. Res..

[23]  Rakesh Kumar Phanden,et al.  Integration of process planning and scheduling: a state-of-the-art review , 2011, Int. J. Comput. Integr. Manuf..

[24]  Jianyang Zhou,et al.  A Constraint Program for Solving the Job-Shop Problem , 1996, CP.

[25]  Shengyao Wang,et al.  An Estimation of Distribution Algorithm-Based Memetic Algorithm for the Distributed Assembly Permutation Flow-Shop Scheduling Problem , 2016, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[26]  Shouyang Wang,et al.  Scheduling of no-wait stochastic distributed assembly flowshop by hybrid PSO , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

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

[28]  D. H. Cummings,et al.  Minimizing production flow time in a process and assembly job shop , 1998 .

[29]  Liang Gao,et al.  A review on Integrated Process Planning and Scheduling , 2010, Int. J. Manuf. Res..

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