1,136
Views
22
CrossRef citations to date
0
Altmetric
Research Article

Supply chain-oriented permutation flowshop scheduling considering flexible assembly and setup times

ORCID Icon, ORCID Icon, &
Pages 258-281 | Received 13 Apr 2020, Accepted 14 Sep 2020, Published online: 18 Nov 2020

References

  • Allahverdi, Ali, and Fawaz S. Al-Anzi. 2006. “Evolutionary Heuristics and an Algorithm for the Two-Stage Assembly Scheduling Problem to Minimize Makespan with Setup Times.” International Journal of Production Research 44 (22): 4713–4735.
  • Behnamian, Javad. 2014. “Decomposition Based Hybrid VNS–TS Algorithm for Distributed Parallel Factories Scheduling with Virtual Corporation.” Computers & Operations Research 52: 181–191.
  • Behnamian, Javad, and S. M. T. Fatemi Ghomi. 2016. “A Survey of Multi-Factory Scheduling.” Journal of Intelligent Manufacturing 27 (1): 231–249.
  • Chan, F. T. S., S. H. Chung, and P. L. Y. Chan. 2005. “An Adaptive Genetic Algorithm with Dominated Genes for Distributed Scheduling Problems.” Expert Systems with Applications 29 (2): 364–371.
  • Chan, F. T. S., S. H. Chung, and P. L. Y. Chan. 2006. “Application of Genetic Algorithms with Dominant Genes in a Distributed Scheduling Problem in Flexible Manufacturing Systems.” International Journal of Production Research 44 (3): 523–543.
  • Cunha, Maria Manuela, Goran D. Putnik, and Paulo Ávila. 2000. “Towards Focused Markets of Resources for Agile Virtual Enterprise Integration.” In International Conference on Information Technology for Balanced Automation Systems, 15–24. Boston, MA: Springer.
  • De Giovanni, Luigi, and Ferdinando Pezzella. 2010. “An Improved Genetic Algorithm for the Distributed and Flexible Job-Shop Scheduling Problem.” European Journal of Operational Research 200 (2): 395–408.
  • Deng, Jin, Ling Wang, Sheng-Yao Wang, and Xiao-long 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.
  • Fernandez-Viagas, Victor, and Jose M Framinan. 2015a. “A Bounded-Search Iterated Greedy Algorithm for the Distributed Permutation Flowshop Scheduling Problem.” International Journal of Production Research 53 (4): 1111–1123.
  • Fernandez-Viagas, Victor, and Jose M. Framinan. 2015b. “NEH-Based Heuristics for the Permutation Flowshop Scheduling Problem to Minimise Total Tardiness.” Computers & Operations Research 60: 27–36.
  • Fernandez-Viagas, Victor, Rubén Ruiz, and Jose M Framinan. 2017. “A New Vision of Approximate Methods for the Permutation Flowshop to Minimise Makespan: State-of-the-Art and Computational Evaluation.” European Journal of Operational Research 257 (3): 707–721.
  • Ferone, Daniele, Sara Hatami, Eliana M. González-Neira, Angel A. Juan, and Paola Festa. 2020. “A Biased-Randomized Iterated Local Search for the Distributed Assembly Permutation Flow-Shop Problem.” International Transactions in Operational Research 27 (3): 1368–1391.
  • Gao, Jian, and Rong Chen. 2011. “A Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem.” International Journal of Computational Intelligence Systems 4 (4): 497–508.
  • Gao, Jian, Rong Chen, and Wu Deng. 2013. “An Efficient Tabu Search Algorithm for the Distributed Permutation Flowshop Scheduling Problem.” International Journal of Production Research 51 (3): 641–651.
  • Gao, J., R. Chen, W. Deng, and Y. Liu. 2012. “Solving Multi-Factory Flowshop Problems with a Novel Variable Neighbourhood Descent Algorithm.” Journal of Computational Information Systems 8 (5): 2025–2032.
  • Gonzalez-Neira, Eliana Maria, Daniele Ferone, Sara Hatami, and Angel A Juan. 2017. “A Biased-Randomized Simheuristic for the Distributed Assembly Permutation Flowshop Problem with Stochastic Processing Times.” Simulation Modelling Practice and Theory 79: 23–36.
  • Graham, Ronald L., Eugene L. Lawler, Jan Karel Lenstra, and A. H. G. Rinnooy Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.” Annals of Discrete Mathematics 5: 287–326.
  • Hariri, A. M. A., and C. N. Potts. 1997. “A Branch and Bound Algorithm for the Two-Stage Assembly Scheduling Problem.” European Journal of Operational Research 103 (3): 547–556.
  • Hatami, Sara, Ruben Ruiz, and Carlos Andres-Romano. 2013. “The Distributed Assembly Permutation Flowshop Scheduling Problem.” International Journal of Production Research 51 (17): 5292–5308.
  • Hatami, Sara, Rubén Ruiz, and Carlos Andrés-Romano. 2014. “Simple Constructive Heuristics for the Distributed Assembly Permutation Flowshop Scheduling Problem with Sequence Dependent Setup Times.” In International Conference on Control, Decision and Information Technologies (CoDIT), 19–23, IEEE. doi: 10.1109/CoDIT.2014.6996861.
  • Hatami, Sara, Rubén Ruiz, and Carlos Andrés-Romano. 2015. “Heuristics and Metaheuristics for the Distributed Assembly Permutation Flowshop Scheduling Problem with Sequence Dependent Setup Times.” International Journal of Production Economics 169: 76–88.
  • Jia, H. Z., Jerry Y. H. Fuh, Andrew Y. C. Nee, and Y. F. Zhang. 2002. “Web-Based Multi-Functional Scheduling System for a Distributed Manufacturing Environment.” Concurrent Engineering 10 (1): 27–39.
  • Jia, H. Z., Jerry Y. H. Fuh, Andrew Y. C. Nee, and Y. F. Zhang. 2007. “Integration of Genetic Algorithm and Gantt Chart for Job Shop Scheduling in Distributed Manufacturing Systems.” Computers & Industrial Engineering 53 (2): 313–320.
  • Jia, H. Z., Andrew Y. C. Nee, Jerry Y. H. Fuh, and Y. F. Zhang. 2003. “A Modified Genetic Algorithm for Distributed Scheduling Problems.” Journal of Intelligent Manufacturing 14 (3–4): 351–362.
  • Johnson, Selmer Martin. 1954. “Optimal Two-and Three-Stage Production Schedules with Setup Times Included.” Naval Research Logistics Quarterly 1 (1): 61–68.
  • Jung, Sunwoong, Young-Bin Woo, and Byung Soo Kim. 2017. “Two-Stage Assembly Scheduling Problem for Processing Products with Dynamic Component-Sizes and a Setup Time.” Computers & Industrial Engineering 104: 98–113.
  • Lee, Chung-Yee, T. C. E. Cheng, and B. M. T. Lin. 1993. “Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem.” Management Science 39 (5): 616–625.
  • Liao, Ching-Jong, Cheng-Hsiung Lee, and Hong-Chieh 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.
  • Lin, Shih-Wei, Chen-Yang Cheng, Pourya Pourhejazy, and Kuo-Ching Ying. 2020. “Multi-Temperature Simulated Annealing for Optimizing Mixed-Blocking Permutation Flowshop Scheduling Problems.” Expert Systems with Applications 165: 113837.
  • Lin, Jian, Zhou-Jing Wang, and Xiaodong Li. 2017. “A Backtracking Search Hyper-Heuristic for the Distributed Assembly Flow-Shop Scheduling Problem.” Swarm and Evolutionary Computation 36: 124–135.
  • Lin, Shih-Wei, Kuo-Ching Ying, and Chien-Yi Huang. 2013. “Minimising Makespan in Distributed Permutation Flowshops Using a Modified Iterated Greedy Algorithm.” International Journal of Production Research 51 (16): 5029–5038.
  • Lin, Jian, and Shuai Zhang. 2016. “An Effective Hybrid Biogeography-Based Optimization Algorithm for the Distributed Assembly Permutation Flow-Shop Scheduling Problem.” Computers & Industrial Engineering 97: 128–136.
  • Luo, Jian-Chao, Zhi-Qiang Liu, and Ke-Yi Xing. 2019. “Hybrid Branch and Bound Algorithms for the Two-Stage Assembly Scheduling Problem with Separated Setup Times.” International Journal of Production Research 57 (5): 1398–1412.
  • Naderi, B., and A. Azab. 2014. “Modeling and Heuristics for Scheduling of Distributed Job Shops.” Expert Systems with Applications 41 (17): 7754–7763.
  • Naderi, Bahman, and Rubén Ruiz. 2010. “The Distributed Permutation Flowshop Scheduling Problem.” Computers & Operations Research 37 (4): 754–768.
  • Nawaz, Muhammad, E. Emory Enscore, Jr, and Inyong Ham. 1983. “A Heuristic Algorithm for the M-Machine, n-Job Flow-Shop Sequencing Problem.” Omega 11 (1): 91–95.
  • Pan, Jia-Qi, Wen-Qiang Zou, and Jun-Hua Duan. 2018. “A Discrete Artificial Bee Colony for Distributed Permutation Flowshop Scheduling Problem with Total Flow Time Minimization.” In 2018 37th Chinese Control Conference (CCC), 8379–8383. IEEE.
  • Pourhejazy, Pourya, Oh Kyoung Kwon, Young-Tae Chang, and Hyosoo Park. 2017. “Evaluating Resiliency of Supply Chain Network: A Data Envelopment Analysis Approach.” Sustainability 9 (2): 255. doi:10.3390/su9020255.
  • Pourhejazy, Pourya, Oh Kyoung Kwon, and Hyunwoo Lim. 2019. “Integrating Sustainability into the Optimization of Fuel Logistics Networks.” KSCE Journal of Civil Engineering 23 (3): 1369–1383.
  • Pourhejazy, Pourya, Shih-Wei Lin, Chen-Yang Cheng, Kuo-Ching Ying, and Pei-Yu Lin. 2020. “Improved Beam Search for Optimizing No-Wait Flowshops With Release Times.” IEEE Access 8: 148100–148124.
  • Rauch, Erwin, Patrick Dallasega, and Dominik T Matt. 2016. “Sustainable Production in Emerging Markets Through Distributed Manufacturing Systems (DMS).” Journal of Cleaner Production 135: 127–138.
  • Renna, Paolo. 2013. Production and Manufacturing System Management: Coordination Approaches and Multi-Site Planning: Coordination Approaches and Multi-Site Planning. Hershey, PA: IGI Global. doi:10.4018/978-1-4666-2098-8.
  • Riahi, Vahid, Mostafa Khorramizadeh, M. A. Hakim Newton, and Abdul Sattar. 2017. “Scatter Search for Mixed Blocking Flowshop Scheduling.” Expert Systems with Applications 79: 20–32.
  • Rossit, Daniel Alejandro, Fernando Tohmé, and Mariano Frutos. 2019. “Industry 4.0: Smart Scheduling.” International Journal of Production Research: 57 (12): 3802–3813.
  • Ruiz, Rubén, Quan-Ke Pan, and Bahman Naderi. 2019. “Iterated Greedy Methods for the Distributed Permutation Flowshop Scheduling Problem.” Omega 83: 213–222.
  • Ruiz, Rubén, and Thomas Stützle. 2007. “A Simple and Effective Iterated Greedy Algorithm for the Permutation Flowshop Scheduling Problem.” European Journal of Operational Research 177 (3): 2033–2049.
  • Sang, Hong-Yan, Quan-Ke Pan, Jun-Qing Li, Ping Wang, Yu-Yan Han, Kai-Zhou Gao, and Peng Duan. 2019. “Effective Invasive Weed Optimization Algorithms for Distributed Assembly Permutation Flowshop Problem with Total Flowtime Criterion.” Swarm and Evolutionary Computation 44: 64–73.
  • Shao, Weishi, Dechang Pi, and Zhongshi Shao. 2018. “Local Search Methods for a Distributed Assembly No-Idle Flow Shop Scheduling Problem.” IEEE Systems Journal 13 (2): 1945–1956.
  • Vollmann, Thomas E. 2005. Manufacturing Planning and Control for Supply Chain Management. Boston, MA: McGraw-Hill/Irwin.
  • Wang, Ling, Jin Deng, and S. Y. Wang. 2016. “Survey on Optimization Algorithms for Distributed Shop Scheduling.” Control and Decision 31 (1): 1–11.
  • Wang, Ben, Kerang Han, Julie Spoerre, and Chun Zhang. 1997. “Integrated Product, Process and Enterprise Design: Why, What and How?” In Integrated Product, Process and Enterprise Design, 1–20. Boston, MA: Springer.
  • Wang, Shijin, Ming Liu, and Chengbin Chu. 2015. “A Branch-and-Bound Algorithm for Two-Stage No-Wait Hybrid Flow-Shop Scheduling.” International Journal of Production Research 53 (4): 1143–1167.
  • Wang, Sheng-Yao, and Ling Wang. 2015. “An Estimation of Distribution Algorithm-Based Memetic Algorithm for the Distributed Assembly Permutation Flow-Shop Scheduling Problem.” IEEE Transactions on Systems, Man, and Cybernetics: Systems 46 (1): 139–149.
  • Wang, Sheng-Yao, Ling Wang, Min Liu, and Ye Xu. 2013. “An Effective Estimation of Distribution Algorithm for Solving the Distributed Permutation Flow-Shop Scheduling Problem.” International Journal of Production Economics 145 (1): 387–396.
  • Wu, Xiuli, Xiajing Liu, and Ning Zhao. 2019. “An Improved Differential Evolution Algorithm for Solving a Distributed Assembly Flexible Job Shop Scheduling Problem.” Memetic Computing 11 (4): 335–355.
  • Wu, Chin-Chia, Du-Juan Wang, Shuenn-Ren Cheng, I-Hong Chung, and Win-Chin Lin. 2018. “A Two-Stage Three-Machine Assembly Scheduling Problem with a Position-Based Learning Effect.” International Journal of Production Research 56 (9): 3064–3079.
  • Xiong, Fuli, and Keyi Xing. 2014. “Meta-Heuristics for the Distributed Two-Stage Assembly Scheduling Problem with Bi-Criteria of Makespan and Mean Completion Time.” International Journal of Production Research 52 (9): 2743–2766.
  • Xiong, Fuli, Keyi Xing, Feng Wang, Hang Lei, and Libin Han. 2014. “Minimizing the Total Completion Time in a Distributed Two Stage Assembly System with Setup Times.” Computers & Operations Research 47: 92–105.
  • Xu, Ye, Ling Wang, Shengyao Wang, and Min Liu. 2014. “An Effective Hybrid Immune Algorithm for Solving the Distributed Permutation Flow-Shop Scheduling Problem.” Engineering Optimization 46 (9): 1269–1283.
  • Yang, Shengluo, and Zhigang Xu. 2020. “The Distributed Assembly Permutation Flowshop Scheduling Problem with Flexible Assembly and Batch Delivery.” International Journal of Production Research: 1–19. doi:10.1080/00207543.2020.1757174.
  • Ying, Kuo-Ching, and Shih-Wei Lin. 2018. “Minimizing Makespan for the Distributed Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks.” Expert Systems with Applications 92: 132–141.
  • Zhang, Guanghui, and Keyi Xing. 2018. “Memetic Social Spider Optimization Algorithm for Scheduling Two-Stage Assembly Flowshop in a Distributed Environment.” Computers & Industrial Engineering 125: 423–433.
  • Zhang, Guanghui, Keyi Xing, and Feng Cao. 2018a. “Discrete Differential Evolution Algorithm for Distributed Blocking Flowshop Scheduling with Makespan Criterion.” Engineering Applications of Artificial Intelligence 76: 96–107.
  • Zhang, Guanghui, Keyi Xing, and Feng Cao. 2018b. “Scheduling Distributed Flowshops with Flexible Assembly and Set-Up Time to Minimise Makespan.” International Journal of Production Research 56 (9): 3226–3244.
  • Zhang, Guanghui, Keyi Xing, Guangyun Zhang, and Zhenxue He. 2020. “Memetic Algorithm with Meta-Lamarckian Learning and Simplex Search for Distributed Flexible Assembly Permutation Flowshop Scheduling Problem.” IEEE Access 8: 96115–96128. doi:10.1109/ACCESS.2020.2996305.

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.