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

详细信息    查看全文

• 作者：Qin Yang ; Ju Liu ; Yiping Huang ; Yushi Wang…
• 关键词：Theory of constraints ; Multi ; constraint machines ; 4S auto maintenance shop ; Dynamic scheduling
• 刊名：The International Journal of Advanced Manufacturing Technology
• 出版年：2016
• 出版时间：April 2016
• 年：2016
• 卷：83
• 期：9-12
• 页码：1773-1785
• 全文大小：830 KB
• 参考文献：1.Jalilvand-Nejad A, Fattahi P (2013) A mathematical model and genetic algorithm to cyclic flexible job shop scheduling problem. J Intell Manuf. doi:10.​1007/​s10845-013-0841-z
  2.Wang YM, Yin LH, Qin DK (2013) A novel genetic algorithm for flexible job shop scheduling problems with machine disruptions. Int J Adv Manuf Technol 68(5–8):1317–1326CrossRef
  3.Jia S, Hu ZH (2014) Path-relinking tabu search for the multiobjective flexible job shop scheduling problem. Comput Oper Res 47(9):11–26MathSciNet CrossRef
  4.Li JQ, Pan QK, Suganthan PN, Chua TJ (2011) A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem. Int J Prod Res 52(5–8):683–697
  5.Sadrzadeh A (2013) Development of both the AIS and PSO for solving the flexible Job shop scheduling problem. Arab J Sci Eng 38(12):3593–3604CrossRef
  6.Zhang GH, Shao XY, Li PG, Gao ZY (2009) An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput Ind Eng 56(4):1309–1318CrossRef
  7.Xia WJ, Wu ZM (2005) An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 48(2):409–425MathSciNet CrossRef
  8.Rahmati SHA, Zandieh M (2012) A new biogeography-based optimization (BBO) algorithm for the flexible job shop scheduling problem. Int J Adv Manuf Technol 58(9–12):1115–1129CrossRef
  9.Fernndez PMA, Fernanda MPR (2014) A newton-based heuristic algorithm for multi-objective flexible job-shop scheduling problem. J Intell Manuf. doi:10.​1007/​s10845-014-082-0
  10.Karthikeyan S, Asokan P, Nickolas S (2014) A hybrid discrete firefly algorithm for multi-objective flexible job shop scheduling problem with limited resource constraints. Int J Adv Manuf Technol 72(9–12):1567–1579CrossRef
  11.Yuan Y, Xu H (2013) An integrated search heuristic for large scale flexible job shop scheduling problems. Comput Oper Res 40(12):2864–2877MathSciNet CrossRef
  12.Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8(1):687–697CrossRef
  13.Wang L, Zhou G, Xu Y, Wang SY, Liu M (2012) An effective artificial bee colony algorithm for the flexible job-shop scheduling problem. Int J Prod Res 60(1–4):303–315
  14.Horng S, Lin S, Yang FY (2012) Evolutionary algorithm for stochastic job shop scheduling with random processing time. Expert Syst Appl 39(3):3603–3610CrossRef
  15.Li DN, Wang Y, Xiao G, Tang JF (2013) Dynamic parts scheduling in multiple job shop cells considering intercell moves and flexible routes. Comput Oper Res 40(5):1207–1223MathSciNet CrossRef
  16.Rennaa P (2010) Job shop scheduling by pheromone approach in a dynamic environment. Int J Comput Integr Manuf 23(5):412–424CrossRef
  17.Lee ZJ, Lin SW, Ying KC (2010) Scheduling jobs on dynamic parallel machines with sequence-dependent setup times. Int J Comput Integr Manuf 47(5–8):773–781
  18.Pinedo M. (2002) Scheduling: Theory, algorithms, and systems (2nd Edition) . New Jersey, Prentice Hall
  19.He W, Sun DH (2013) Scheduling flexible job shop problem subject to machine breakdown with route changing and right-shift strategies. Int J Adv Manuf Technol 68(1–4):501–514MathSciNet CrossRef
  20.Kamoun H, Sriskandarajah C (1993) The complexity of scheduling jobs in repetitive manufacturing systems. Eur J Oper Res 70(3):350–364CrossRef MATH
  21.Zhang LP, Li XY, Gao L, Zhang GH (2013) Dynamic rescheduling in FMS that is simultaneously considering energy consumption and schedule efficiency. Int J Adv Manuf Technol. doi:10.​1007/​s00170-013 -4867-3
  22.Sabar M, Montreuila B, Frayret JM (2009) A multi-agent-based approach for personnel scheduling in assembly centers. Eng Appl Artif Intell 22(7):1080–1088CrossRef
  23.Yang LX, Zhou XS, Gao ZY (2014) Credibility-based rescheduling model in a double-track railway network: a fuzzy reliable optimization approach. Omega 48(10):75–93CrossRef
  24.Spliet R, Gabor AF, Dekker R (2014) The vehicle rescheduling problem. Comput Oper Res 43(4):129–136MathSciNet CrossRef
  25.Liu L, Zhou H (2013) On the identical parallel-machine rescheduling with job rework disruption. Comput Ind Eng 66(1):186–198CrossRef
  26.Yuan JJ, Mu YD (2007) Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption. Eur J Oper Res 182(2):936–944CrossRef MATH
  27.Cowling PI, Johansson M (2002) Using real time information for effective dynamic scheduling. Eur J Oper Res 139(2):230–244MathSciNet CrossRef MATH
  28.Goldratt EM (1990) The Haystack syndrome: sifting information from the Data Ocean? North River, New York
  29.Badri SA, Ghazanfari M, Shahanaghi K (2014) A multi-criteria decision-making approach to solve the product mix problem with interval parameters. Int J Adv Manuf Technol 70(5–8):1073–1080CrossRef
  30.Sobreiro VA, Nagano MS (2012) A review and evaluation on constructive heuristics to optimise product mix based on the theory of constraints. Int J Prod Res 50(20):5936–5948CrossRef
  31.Wang JQ, Sun SD, Si SB, Yang HA (2009) Theory of constraints product mix optimisation based on immune algorithm. Int J Prod Res 47(16):4521–4543CrossRef MATH
  32.Bhattacharya A, Vasant P, Sarkar B, Mukherjee SK (2008) A fully fuzzified intelligent theory-of-constraints product-mix decision. Int J Prod Res 46(3):789–815CrossRef MATH
  33.Singh RK, Prakash A, Kumar S et al (2006) Psychoclonal based approach to solve a TOC product mix decision problem. Int J Adv Manuf Technol 29(11–12):1194–1202CrossRef
  34.Aryanezhad MB, Komijan AR (2004) An improved algorithm for optimizing productmix under the theory of constraints. Int J Prod Res 42(20):4221–4233CrossRef MATH
  35.Liu LL, Zhao GP, OU’Yang SS, Yang YJ (2011) Integrating theory of constraints and particle swarm optimization in order planning and scheduling for machine tool production. Int J Adv Manuf Technol 57(1–4):285–296CrossRef
  36.Kasemset C, Kachitvichyanukul V (2010) Bi-level multi-objective mathematical model for job-shop scheduling: the application of theory of constraints. Int J Prod Res 48(20):6137–6154CrossRef MATH
  37.Sirikrai V, Yenradee P (2006) Modified drum-bufferrope scheduling mechanism for a non-identical parallel machine flow shop with processing-time variation. Int J Prod Res 44(17):3509–3531CrossRef MATH
  38.Qiu M, Fredendall L, Zhu Z (2002) TOC or LP? [production control]. Manuf Eng 81(4):190–195CrossRef
  39.Uzsoy R, Wang CS (2000) Performance of decomposition procedures for job shop scheduling problems with bottleneck machines. Int J Prod Res 38(0020–7543):1271–1286CrossRef MATH
  40.Wei C, Liu PH, Tsai YC (2002) Resource-constrained project management using enhanced theory of constraint. Int J Proj Manag 20(7):561–567CrossRef
  41.Al-Aomar R (2006) Capacity-constrained production scheduling of multiple vehicle programs in an automotive pilot plant. Int J Prod Res 44(0020–7543):2573–2604CrossRef MATH
  42.Lin JT, Wang FK, Lee WT (2004) Capacity-constrained scheduling for a logic IC final test facility. Int J Prod Res 42(0020–7543):79–99CrossRef MATH
  43.Dastidar SG, Nagi R (2005) Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs. Comput Oper Res 32(11):2987–3005CrossRef MATH
  44.Rashidi KA, Aryanezhad MB, Makui A (2009) A new heuristic approach to solve product mix problems in a multi-bottleneck system. J Ind Eng Int 5(9):46–57
  45.Tanhaei F, Nahavandi N (2013) Algorithm for solving product mix problem in two-constraint resources environment. Int J Adv Manuf Technol 64(5–8):1161–1167CrossRef
  46.Demirkol E, Mehta S, Uzsoy R (1997) A computational study of shifting bottleneck procedures for shop scheduling problems. J Heuristics 3(2):111–137CrossRef MATH
  
• 作者单位：Qin Yang (1)
  Ju Liu (1)
  Yiping Huang (1)
  Yushi Wang (1)
  Tingting Wang (1)
  
  1. Sichuan Normal University, Chengdu, China
  
• 刊物类别：Engineering
• 刊物主题：Industrial and Production Engineering
  Production and Logistics
  Mechanical Engineering
  Computer-Aided Engineering and Design
  
• 出版者：Springer London
• ISSN：1433-3015

文摘

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.