The dynamic 4S auto maintenance shop scheduling in a multi-constraint machine environment based on the theory of constraints

In this paper, 4S auto maintenance shop scheduling with multi-constraint machines is of concern. In 4S auto maintenance shop, it may appear temporary bottlenecks except for the long-term bottlenecks, and they form multi-constraint machines jointly with the task size reaching the peak. Through scheduling the constraint machines effectively, it can improve overall performance of the system to satisfy the customers’ requirements. First, we describe and construct a model for the scheduling problem which can be designed as the dynamic flexible job shop scheduling problem (FJSP) with multi-constraint machines for the goal of minimizing customers’ waiting time. Then, putting an emphasis on the constraint machines, we apply the theory of constraint to decompose and simplify the complex system and also construct the coordination mechanism between constraint machines and non-constraint machines. After that, an improved constraint-guided heuristic algorithm is proposed to solve the constraint machine scheduling problem, while different dispatching rules are selected for solving the non-constraint machine scheduling according to the location of the non-bottleneck in the system. What is more, we design the rescheduling rules combing characteristics of the problem to realize dynamic scheduling with multi-constraint machines. Finally, 4S auto maintenance shop scheduling with high workload during the rush hour (on the eve of the holiday) served as the actual cases, and the proposed algorithm is compared with three different dispatching rules under various size of problems. The result obtained from the computational study has shown that the proposed algorithm is much better.

[1]  Jinjiang Yuan,et al.  Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption , 2007, Eur. J. Oper. Res..

[2]  Zhi-Hua Hu,et al.  Path-relinking Tabu search for the multi-objective flexible job shop scheduling problem , 2014, Comput. Oper. Res..

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

[4]  S. K. Mukherjee,et al.  A fully fuzzified, intelligent theory-of-constraints product-mix decision , 2008 .

[5]  Fu-Kwun Wang,et al.  Capacity-constrained scheduling for a logic IC final test facility , 2004 .

[6]  Ziyou Gao,et al.  Credibility-based rescheduling model in a double-track railway network: a fuzzy reliable optimization approach , 2014 .

[7]  Manoj Kumar Tiwari,et al.  Psycho-clonal based approach to solve a TOC product mix decision problem , 2006 .

[8]  Rommert Dekker,et al.  The vehicle rescheduling problem , 2009, Comput. Oper. Res..

[9]  Amir Sadrzadeh,et al.  Development of Both the AIS and PSO for Solving the Flexible Job Shop Scheduling Problem , 2013, Arabian Journal for Science and Engineering.

[10]  Chompoonoot Kasemset,et al.  Bi-level multi-objective mathematical model for job-shop scheduling: the application of Theory of Constraints , 2010 .

[11]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[12]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

[13]  Zhiwei Zhu,et al.  TOC or LP? [production control] , 2002 .

[14]  Ahmad Makui,et al.  A new heuristic approach to solve product mix problems in a multi-bottleneck system , 2009 .

[15]  Peter Cowling,et al.  Production, Manufacturing and Logistics Using real time information for effective dynamic scheduling , 2002 .

[16]  Shengyao Wang,et al.  An effective artificial bee colony algorithm for the flexible job-shop scheduling problem , 2012 .

[17]  Chiu-Chi Wei,et al.  Resource-constrained project management using enhanced theory of constraint , 2002 .

[18]  Marcelo Seido Nagano,et al.  A review and evaluation on constructive heuristics to optimise product mix based on the Theory of Constraints , 2012 .

[19]  Chelliah Sriskandarajah,et al.  The complexity of scheduling jobs in repetitive manufacturing systems , 1993 .

[20]  P. Suganthan,et al.  A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem , 2011 .

[21]  Shih-Cheng Horng,et al.  Evolutionary algorithm for stochastic job shop scheduling with random processing time , 2012, Expert Syst. Appl..

[22]  Wei He,et al.  Scheduling flexible job shop problem subject to machine breakdown with route changing and right-shift strategies , 2013 .

[23]  Shudong Sun,et al.  Theory of constraints product mix optimisation based on immune algorithm , 2009 .

[24]  Yong Ming Wang,et al.  A novel genetic algorithm for flexible job shop scheduling problems with machine disruptions , 2013, The International Journal of Advanced Manufacturing Technology.

[25]  Hua Xu,et al.  An integrated search heuristic for large-scale flexible job shop scheduling problems , 2013, Comput. Oper. Res..

[26]  Paolo Renna,et al.  Job shop scheduling by pheromone approach in a dynamic environment , 2010, Int. J. Comput. Integr. Manuf..

[27]  Yan Wang,et al.  Dynamic parts scheduling in multiple job shop cells considering intercell moves and flexible routes , 2013, Comput. Oper. Res..

[28]  Benoît Montreuil,et al.  A multi-agent-based approach for personnel scheduling in assembly centers , 2009, Eng. Appl. Artif. Intell..

[29]  R. Al-Aomar,et al.  Capacity-constrained production scheduling of multiple vehicle programs in an automotive pilot plant , 2006 .

[30]  M. Aryanezhad,et al.  An improved algorithm for optimizing product mix under the theory of constraints , 2004 .

[31]  Kamran Shahanaghi,et al.  A multi-criteria decision-making approach to solve the product mix problem with interval parameters based on the theory of constraints , 2014 .

[32]  Shih-Wei Lin,et al.  Scheduling jobs on dynamic parallel machines with sequence-dependent setup times , 2010 .

[33]  Mostafa Zandieh,et al.  A new biogeography-based optimization (BBO) algorithm for the flexible job shop scheduling problem , 2012 .

[34]  Guohui Zhang,et al.  Dynamic rescheduling in FMS that is simultaneously considering energy consumption and schedule efficiency , 2016 .

[35]  Hong Zhou,et al.  On the identical parallel-machine rescheduling with job rework disruption , 2013, Comput. Ind. Eng..

[36]  S. Karthikeyan,et al.  A hybrid discrete firefly algorithm for multi-objective flexible job shop scheduling problem with limited resource constraints , 2014, The International Journal of Advanced Manufacturing Technology.

[37]  Reha Uzsoy,et al.  A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems , 1997, J. Heuristics.

[38]  Rakesh Nagi,et al.  Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs , 2005, Comput. Oper. Res..

[39]  Fernanda M. P. Raupp,et al.  A Newton-based heuristic algorithm for multi-objective flexible job-shop scheduling problem , 2016, J. Intell. Manuf..

[40]  Nasim Nahavandi,et al.  Algorithm for solving product mix problem in two-constraint resources environment , 2013 .

[41]  Parviz Fattahi,et al.  A mathematical model and genetic algorithm to cyclic flexible job shop scheduling problem , 2015, J. Intell. Manuf..

[42]  Reha Uzsoy,et al.  Performance of decomposition procedures for job shop scheduling problems with bottleneck machines , 2000 .

[43]  Gai-Ping Zhao,et al.  Integrating theory of constraints and particle swarm optimization in order planning and scheduling for machine tool production , 2011 .

[44]  Liang Gao,et al.  An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem , 2009, Comput. Ind. Eng..

[45]  Pisal Yenradee,et al.  Modified drum–buffer–rope scheduling mechanism for a non-identical parallel machine flow shop with processing-time variation , 2006 .