275
Views
0
CrossRef citations to date
0
Altmetric
Research Articles

Production scheduling problem with assembly flow shop systems: mathematical optimisation models

&
Pages 2483-2498 | Received 10 Dec 2021, Accepted 15 May 2023, Published online: 31 May 2023

References

  • Carla, T., V. Fernandez-Viagas, P. Perez-Gonzalez, and F. M. Jose. 2020. “New Efficient Constructive Heuristics for the Two-Stage Multi-Machine Assembly Scheduling Problem.” Computers & Industrial Engineering 40: 106223. doi:10.1016/j.cie.2019.106223.
  • Cheng, T. C. E., and G. Wang. 1999. “Scheduling the Fabrication and Assembly of Components in a Two-Machine Flow Shop.” IIE Transactions 31: 135–143. doi:10.1023/A:1007512501565.
  • Deng, J., L. Wang, S. Y. Wang, and X. L. Zheng. 2016. “A Competitive Memetic Algorithm for the Distributed two-Stage Assembly Flow-Shop Scheduling Problem.” International Journal of Production Research 54 (12): 3561–3577. doi:10.1080/00207543.2015.1084063.
  • Dolan, E. D., and J. J. Moré. 2002. “Benchmarking Optimization Software with Performance Profiles.” Mathematical Programming 91 (2): 201–213. doi:10.1007/s101070100263. Springer Science and Business Media LLC.
  • Fattahi, P., S. M. H. Hosseini, F. Jolai, and R. Tavakkoli-Moghaddam. 2014. “A Branch and Bound Algorithm for Hybrid Flow Shop Scheduling Problem with Setup Time and Assembly Operations.” Applied Mathematical Modelling 38 (1): 119–134. doi:10.1016/j.apm.2013.06.005.
  • Framinan, J. M., P. Perez-Gonzalez, and V. Fernandez-Viagas. 2019. “Deterministic Assembly Scheduling Problems: A Review and Classification of Concurrent-Type Scheduling Models and Solution Procedures.” European Journal of Operational Research 273: 401–417. doi:10.1016/j.ejor.2018.04.033.
  • Gaafar, L. K., and S. A. Masoud. 2005. “Genetic Algorithms and Simulated Annealing for Scheduling in Agile Manufacturing.” International Journal of Production Research 43(14): 3069–3085. doi:10.1080/00207540412331333414.
  • Gaafar, L. K., S. A. Masoud, and A. O. Nassef. 2008. “A Particle Swarm-Based Genetic Algorithm for Scheduling in an Agile Environment.” Computers & Industrial Engineering 55 (3): 707–720. doi:10.1016/j.cie.2008.01.020.
  • Guimarães, I. F., Y. Ouazene, M. C. de Souza, and F. Yalaoui. 2016. “Semi-Parallel Flow Shop with a Final Synchronization Operation Scheduling Problem.” IFAC-PapersOnLine 49 (12): 1032–1037. doi:10.1016/j.ifacol.2016.07.578.
  • Haouari, M., and T. Daouas. 1999. “Optimal Scheduling of the 3-Machine Assembly-Type Flow Shop.” RAIRO – Operations Research 33 (4): 439–445. doi:10.1051/ro:1999120.
  • Hariri, A. M. A., and C. N. Potts. 1997. “A Branch- and Bound Algorithm for the Two-Stage Assembly.” European Journal of Operational Research 103: 547–556. doi:10.1016/S0377-2217(96)00312-8.
  • Hatami, S., R. Ruiz, and C. Andrés-Romano. 2013. “The Distributed Assembly Permutation Flow Shop Scheduling Problem.” International Journal of Production Research 51 (17): 5292–5308. doi:10.1080/00207543.2013.807955.
  • He, D., and A. Babayan. 2002. “Scheduling Manufacturing Systems for Delayed Product Differentiation in Agile Manufacturing.” International Journal of Production Research 40 (11): 2461–2481. doi:10.1080/00207540210136522.
  • He, D., A. Babayan, and A. Kusiak. 2001. “Scheduling Manufacturing Systems in an AGILE ENVIROnment.” Robotics and Computer Integrated Manufacturing 17: 2461–2481. doi:10.1016/S0736-5845(00)00041-7.
  • Johnson, S. M. 1954. “Optimal Two-and Three-Stage Production Schedules with setup times included.” Naval Research Logistics Quarterly 1: 61–68. doi:10.1002/nav.3800010110.
  • Jung, S., Y.-B. Woo, and B. S. Kim. 2017. “Two-stage assembly scheduling problem for processing products with dynamic component-sizes and a setup time.” Computers & Industrial Engineering 104: 98–113. doi:10.1016/j.cie.2016.12.030.
  • Kheirandish, O., R. Tavakkoli-Moghaddam, and M. Karimi-Nasab. 2015. “An Artificial Bee Colony Algorithm for a Two-Stage Hybrid Flowshop Scheduling Problem with Multilevel Product Structures and Requirement Operations.” International Journal of Computer Integrated Manufacturing 28 (5): 437–450. doi:10.1080/0951192X.2014.880805.
  • Kiran, A. S., and S. Alptekin. 1985. “Scheduling Algorithms for Flexible Manufacturing System.” Dept. of Industrial and Systems Engineering, University of Southern California, Los Angeles. n. 85.
  • Komaki, G. M., S. Sheikh, and B. Malakooti. 2018. “Flow Shop Scheduling Problems with Assembly Operations: A Review and Latest Trends.” International Journal Of Production Research 57 (10): 2926–2955. doi:10.1080/00207543.2018.1550269.
  • Koulamas, C., and G. J. Kyparisis. 2001. “The Three-Stage Assembly Flowshop Scheduling Problem.” Computers and Operations Research 28: 689–704. doi:10.1016/S0305-0548(00)00004-6.
  • Kusiak, A. 1989a. “Aggregate Scheduling of a Flexible Machining and Assembly System.” IEEE Transactions on Robotics Automation 5 (4): 451–459. doi:10.1109/70.88060.
  • Kusiak, A. 1989b. “Scheduling Flexible Machining and Assembly System.” In Proc. 2nd ORSA/TIMS Conf. on Flexible Manufacturing Systems: Operations Research Methods and Applications, edited by K. E. Stecke, and R. Suri, 521–532. New York, NY: Elsevier.
  • Kusiak, A., and M. Chen. 1988. “KBSS: A Knowledge-Based System for Manufacturing Scheduling,” Working Paper. Dep. of Mech. and Industry Eng., Univ. of Manitoba, Canada.
  • Lee, I. S. 2020. “A Scheduling Problem to Minimize Total Weighted Tardiness in the Two-Stage Assembly Flowshop.” Mathematical Problems In Engineering 2020: 1–10. doi:10.1155/2020/9723439.
  • Lee, C. Y., T. C. E. Cheng, and B. M. T. Lin. 1993. “Minimizing the Makespan in the 3-Machine Assembly-Type Flow Shop Scheduling Problem.” Management Science 39: 616–625. doi:10.1287/mnsc.39.5.616.
  • Liao, C. J., C. H. Lee, and H. C. Lee. 2015. “An Efficient Heuristic for a Two-Stage Assembly Scheduling Problem with Batch Setup Times to Minimize Makespan.” Computers & Industrial Engineering 88: 317–325. doi:10.1016/j.cie.2015.07.018.
  • Lin, B. M. T., and T. C. E. Cheng. 2002. “Fabrication and Assembly Scheduling in a Two Machine Flowshop.” IIE Transactions 34: 1015–1020. doi:10.1023/a:1016190815843.
  • Lustosa, L. J., M. A. de Mesquita, O. L. G. Quelhas, and R. J. de Oliveira 2008. Planejamento e Controle da Produção. Rio de Janeiro: Elsevier.
  • Manne, A. 1959. “On the Job Shop Scheduling Problem”. Cowles Foundation Discussion. Cowles Foundation for Research in Economics, Yale University, v. 73.
  • Morton, T. E., and T. L Smunt. 1986. “A Planning and Scheduling System for Flexible Manufacturing.” In Flexible Manufacturing Systems: Methods and Studies, edited by T. E. Morton and T. L. Smunt, 151–164. Amsterdam: North-Holland.
  • Navaei, J., S. M. T. Fatemi Ghomi, F. Jolai, and A. Mozdgir. 2014. “Heuristics for an Assembly Flow-Shop with Non-Identical Assembly Machines and Sequence Dependent Setup Times to Minimize Sum of Holding and Delay Costs.” Computers and Operations Research 44: 52–65. doi:10.1016/j.cor.2013.10.008.
  • Navaei, J., S. F. Ghomi, F. Jolai, M. E. Shiraqai, and H. Hidaji. 2013. “Two-Stage Flow-Shop Scheduling Problem with NonIdentical Second Stage Assembly Machines.” The International Journal of Advanced Manufacturing Technology 69 (9–12): 2215–2226. doi:10.1007/s00170-013-5187-3.
  • Nawaz, M., E. E. Enscore, and I. Ham. 1983. “A Heuristic Algorithm for the m-machine, n-job Flow-Shop Sequencing Problem.” Omega 11 (1): 91–95. doi:10.1016/0305-0483(83)90088-9.
  • Nejati, M., I. Mahdavi, R. Hassanzadeh, and N. Mahdavi-Amiri. 2016. “Lot Streaming in a Two-Stage Assembly Hybrid Flow Shop Scheduling Problem with a Work Shift Constraint.” Journal of Industrial and Production Engineering 33 (7): 459–471. doi:10.1080/21681015.2015.1126653.
  • Nikzad, F., J. Rezaeian, I. Mahdavi, and I. Rastgar. 2015. “Scheduling of Multi-Component Products in a Two-Stage Flexible Flow Shop.” Applied Soft Computing 32: 132–143. doi:10.1016/j.asoc.2015.03.006.
  • Pinedo, M. L. 2005. Planning and Scheduling in Manufacturing and Services. New York: Springer.
  • Potts, C. N., S. V. Sevast'Janov, and C. M. Zwaneveld. 1995. “The Two-stage Assembly Scheduling Problem: Complexity and Approximation.” Operations Research 43: 346–355. doi:10.1287/opre.43.2.346.
  • Sarin, S. C., L. Yao, and D. Trietsch. 2011. “Single Batch Lot Streaming in a Two Stage Assembly System.” International Journal of Planning and Scheduling 1 (1–2): 90–108. doi:10.1504/IJPS.2011.044604.
  • Sheikh, S., G. M. Komaki, V. Kayvanfar, and E. Teymourian. 2019. “Multi-Stage Assembly Flowshop with Setup Time and Release Time.” Operations Research Perspectives 6: 100–111. doi:10.1016/j.orp.2019.100111.
  • Sousa, J. P., and L. A. Wolsey. 1992. “A time Indexed Formulation of Non-preemptive Single Machine Scheduling Problems.” Mathematical Programming 54: 353–367. doi:10.1007/BF01586059.
  • Sung, C. S., and J. Juhn. 2009. “Makespan Minimization for a 2-Stage Assembly Scheduling Problem Subject to Component Available Time Constraint.” International Journal of Production Economics 119 (2): 392–401. doi:10.1016/j.ijpe.2009.03.012.
  • Talens, C., V. Fernandez-Viagas, P. Perez-Gonzalez, and J. M. Framinan. 2020. “New Efficient Constructive Heuristics for the Two-Stage Multi-Machine Assembly Scheduling Problem.” Computers & Industrial Engineering 140: 106223. doi:10.1016/j.cie.2019.106223.
  • Unlu, Y., and S. J. Mason. 2010. “Evaluation of Mixed Integer Programming Formulations for Non-preemptive Parallel Machine Scheduling Problems.” Computers & Industrial Engineering 58: 785–800. doi:10.1016/j.cie.2010.02.012.
  • Zhang, Z., and Q. Tang. 2021. “Integrating Flexible Preventive Maintenance Activities into Two-Stage Assembly Flow Shop Scheduling with Multiple Assembly Machines.” Computers & Industrial Engineering 159: 107493. doi:10.1016/j.cie.2021.107493.
  • Zhang, Y., Z. Zhou, and J. Liu. 2010. “The Production Scheduling Problem in a Multi-Page Invoice Printing System.” Computers and Operations Research 37: 1814–1821. doi:10.1016/j.cor.2010.01.014.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.