Efficient approximation scheme for job assignment in a multi-factory environment

References

• Morris W, Mishra N. Online decision support system for finished lamb production. Int J Serv Econ Manage. 2014;6:209–221.
   Google Scholar
• Behnamian J, Ghomi SMTF. A survey of multi-factory scheduling. J Intell Manuf. 2016;27:231–249.
   Web of Science ®Google Scholar
• Dallery Y, Gershwin SB. Manufacturing flow line systems: a review of models and analytical results. Queueing Syst. 1992;12:3–94.
   Google Scholar
• Buzacott JA, Shanthikumar JG. Stochastic models of manufacturing systems, vol. 4. NJ: Prentice Hall Englewood Cliffs; 1993.
   Google Scholar
• Timpe CH, Kallrath J. Optimal planning in large multi-site production networks. Eur J Oper Res. 2000;126:422–435.
   Web of Science ®Google Scholar
• Tamura T, Long H, Ohno K. A sequencing problem to level part usage rates and work loads for a mixed-model assembly line with a bypass subline. Int J Prod Econ. 1999;60:557–564.
   Web of Science ®Google Scholar
• Lovgren RH, Racer MJ. Algorithms for mixed-model sequencing with due date restrictions. Eur J Oper Res. 2000;120:408–422.
   Web of Science ®Google Scholar
• Cheldelin B, Ishii K. Mixed model assembly quality: an approach to prevent human errors. Proc Am Soci Mech Eng Des Eng Div. 2004;17:109–119.
   Google Scholar
• Jainury SM, Ramli R, Ab Rahman MN, et al. Integrated set parts supply system in a mixed-model assembly line. Comput Ind Eng. 2014;75:266–273.
   Web of Science ®Google Scholar
• Cheng TCE, Sin CCS. A state-of-the-art review of parallel-machine scheduling research. Eur J Oper Res. 1990;47:271–292.
   Web of Science ®Google Scholar
• Hsu CJ, Cheng TCE, Yang DL. Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time. Inf Sci. 2011;181:4799–4803.
   Web of Science ®Google Scholar
• Zhao C, Ji M, Tang H. Parallel-machine scheduling with an availability constraint. Comput Ind Eng. 2011;61:778–781.
   Web of Science ®Google Scholar
• Zhang M, Luo C. Parallel-machine scheduling with deteriorating jobs, rejection and a fixed non-availability interval. Appl Math Comput. 2013;224:405–411.
   Web of Science ®Google Scholar
• Liaw CF. A branch-and-bound algorithm for identical parallel machine total tardiness scheduling problem with preemption. J Ind Prod Eng. 2016;33(6):426–434.
   Web of Science ®Google Scholar
• Enjalbert S, Archimède B, Charbonnaud P. Distributed simulation of virtual workshops for the multi-site scheduling feasibility evaluation. Int J P Res. 2011;49:6663–6676.
   Web of Science ®Google Scholar
• Behnamian J, Ghomi SMTF. The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine. Inf Sci. 2013;219:181–196.
   Web of Science ®Google Scholar
• De Giovanni L, Pezzella F. An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. Eur J Oper Res. 2010;200:395–408.
   Web of Science ®Google Scholar
• Manikas A, Chang YL. Multi-criteria sequence-dependent job shop scheduling using genetic algorithms. Comput Ind Eng. 2009;56:179–185.
   Web of Science ®Google Scholar
• Naderi B, Ruiz R. A scatter search algorithm for the distributed permutation flowshop scheduling problem. Eur J Oper Res. 2014;239:323–334.
   Web of Science ®Google Scholar
• Pan QK, Tasgetiren MF, Liang YC. A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Comput Ind Eng. 2008;55:795–816.
   Web of Science ®Google Scholar
• Tseng YJ, Jhang JF, Huang FY. Multi-plant assembly planning models for a collaborative manufacturing environment. Int J P Res. 2007;45:3333–3349.
   Web of Science ®Google Scholar
• Tseng YJ, Huang FY. A multi-plant tolerance allocation model for products manufactured in a multi-plant collaborative manufacturing environment. Int J P Res. 2009;47:733–749.
   Web of Science ®Google Scholar
• Tseng YJ, Chen JY, Huang FY. A particle swarm optimisation algorithm for multi-plant assembly sequence planning with integrated assembly sequence planning and plant assignment. Int J P Res. 2010;48:2765–2791.
   Web of Science ®Google Scholar
• Yang W, Fung RYK. An available-to-promise decision support system for a multi-site make-to-order production system. Int J P Res. 2014;52:4253–4266.
   Web of Science ®Google Scholar
• Francie KA, Jean-Pierre K, Pierre D, et al. Stochastic models and numerical solutions for manufacturing/remanufacturing systems with applications to the printer cartridge industry. J Manuf Syst. 2015;37:662–671.
   Web of Science ®Google Scholar
• Darvish M, Larrain H, Coelho LC. A dynamic multi-plant lot-sizing and distribution problem. Int J P Res. 2016;54:6707–6717.
   Web of Science ®Google Scholar
• Nascimento MCV, Resende MGC, Toledo FMB. GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem. Eur J Oper Res. 2010;200:747–754.
   Web of Science ®Google Scholar
• Mohammadi M, Musa SN, Omar MB. Optimisation of multi-plant capacitated lot-sizing problems in an integrated supply chain network using calibrated metaheuristic algorithms. Int J Oper Res. 2020;3(39):325.
   Google Scholar
• Behnamian J, Fatemi Ghomi SMT. Multi-objective multi-factory scheduling. RAIRO Oper Res. 2020; Forthcoming.
   Web of Science ®Google Scholar
• Moon C, Seo Y. Evolutionary algorithm for advanced process planning and scheduling in a multi-plant. Comput Ind Eng. 2005;48:311–325.
   Web of Science ®Google Scholar
• Azevedo MM, Crispim JA, Sousa JP. A dynamic multi-objective approach for the reconfigurable multi-facility layout problem. J Manuf Syst. 2017;42:140–152.
   Web of Science ®Google Scholar
• Verma A, Shukla N, Tyagi S, et al. Stochastic modelling and optimisation of multi-plant capacity planning problem. Int J Intell Eng Inf. 2014;2:139–165.
   Google Scholar
• Janiak A, Janiak W, Kovalyov MY. Due window assignment and scheduling on parallel machines: a FPTAS for a bottleneck criterion. Bull Pol Acad Sci Tech Sci. 2014;62:805–808.
   Web of Science ®Google Scholar
• Kacem I, Sahnoune M, Schmidt G. Strongly fully polynomial time approximation scheme for the weighted completion time minimization problem on two-parallel capacitated machines. IFAC-PapersOnLine. 2016;49:425–430.
   Google Scholar
• Baptiste P, Rebaine D, Zouba M. FPTAS for the two identical parallel machine problem with a single operator under the free changing mode. Eur J Oper Res. 2017;256:55–61.
   Web of Science ®Google Scholar
• Gens GV, Levner EV. Fast approximation algorithm for job sequencing with deadlines. Discrete Appl Math. 1981;3:313–318.
   Web of Science ®Google Scholar
• Levner E, Elalouf A. An improved approximation algorithm for the ancient scheduling problem with deadlines. In Control, Decision and Information Technologies (CoDIT), 2014 International Conference; 2014.
   Google Scholar
• Ergun F, Sinha R, Zhang L. An improved FPTAS for restricted shortest path. Inf Process Lett. 2002;83:287–291.
   Web of Science ®Google Scholar
• Elalouf A, Levner E. Improving the solution complexity of the scheduling problem with deadlines: A general technique. RAIRO Oper Res. 2016;50:681–687.
   Web of Science ®Google Scholar