867
Views
14
CrossRef citations to date
0
Altmetric
Research Articles

Permutation flow shop energy-efficient scheduling with a position-based learning effect

ORCID Icon, ORCID Icon, , ORCID Icon & ORCID Icon
Pages 382-409 | Received 24 Jun 2021, Accepted 13 Nov 2021, Published online: 08 Dec 2021

References

  • Allahverdi, Ali. 2015. “The Third Comprehensive Survey on Scheduling Problems with Setup Times/Costs.” European Journal of Operational Research 246 (2): 345–378.
  • Allahverdi, Ali, C. T. Ng, T. C. Edwin Cheng, and Mikhail Y Kovalyov. 2008. “A Survey of Scheduling Problems with Setup Times or Costs.” European Journal of Operational Research 187 (3): 985–1032.
  • Bai, Danyu, Xiaoyuan Bai, Jie Yang, Xingong Zhang, Tao Ren, Chenxi Xie, and Bingqian Liu. 2021. “Minimization of Maximum Lateness in a Flowshop Learning Effect Scheduling with Release Dates.” Computers & Industrial Engineering 158: 107309.
  • Biskup, Dirk. 1999. “Single-machine Scheduling with Learning Considerations.” European Journal of Operational Research 115 (1): 173–178.
  • Biskup, Dirk. 2008. “A State-of-the-Art Review on Scheduling with Learning Effects.” European Journal of Operational Research 188 (2): 315–329.
  • Che, Ada, Yizeng Zeng, and Ke Lyu. 2016. “An Efficient Greedy Insertion Heuristic for Energy-Conscious Single Machine Scheduling Problem Under Time-of-use Electricity Tariffs.” Journal of Cleaner Production 129: 565–577.
  • Coello, Carlos A. Coello, Gregorio Toscano Pulido, and M. Salazar Lechuga. 2004. “Handling Multiple Objectives with Particle Swarm Optimization.” IEEE Transactions on Evolutionary Computation 8 (3): 256–279.
  • Deb, Kalyanmoy, Amrit Pratap, Sameer Agarwal, and T. A. M. T. Meyarivan. 2002. “A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II.” IEEE Transactions on Evolutionary Computation 6 (2): 182–197.
  • Fernandez-Viagas, Victor, and Jose M Framinan. 2019. “A Best-of-Breed Iterated Greedy for the Permutation Flowshop Scheduling Problem with Makespan Objective.” Computers & Operations Research 112: 104767.
  • Fernandez-Viagas, Victor, Jorge MS Valente, and Jose M Framinan. 2018. “Iterated-Greedy-Based Algorithms with Beam Search Initialization for the Permutation Flowshop to Minimise Total Tardiness.” Expert Systems with Applications 94: 58–69.
  • Gao, Fu, Mengqi Liu, Jian-Jun Wang, and Yuan-Yuan Lu. 2018. “No-Wait Two-Machine Permutation Flow Shop Scheduling Problem with Learning Effect, Common Due Date and Controllable Job Processing Times.” International Journal of Production Research 56 (6): 2361–2369.
  • Gao, Kai-Zhou, Ponnuthurai N. Suganthan, Quan-Ke Pan, Tay Jin Chua, Tian Xiang Cai, and Chin-Soon Chong. 2014. “Pareto-Based Grouping Discrete Harmony Search Algorithm for Multi-Objective Flexible Job Shop Scheduling.” Information Sciences 289: 76–90.
  • Gere Jr, S. William. 1966. “Heuristics in Job Shop Scheduling.” Management Science 13 (3): 167–190.
  • 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.
  • Gupta, Jatinder N.D., and William P Darrow. 1986. “The Two-Machine Sequence Dependent Flowshop Scheduling Problem.” European Journal of Operational Research 24 (3): 439–446.
  • Han, Wenwu, Qianwang Deng, Guiliang Gong, Like Zhang, and Qiang Luo. 2021. “Multi-Objective Evolutionary Algorithms with Heuristic Decoding for Hybrid Flow Shop Scheduling Problem with Worker Constraint.” Expert Systems with Applications 168: 114282.
  • Haupt, Reinhard. 1989. “A Survey of Priority Rule-Based Scheduling.” Operations-Research-Spektrum 11 (1): 3–16.
  • Ishibuchi, Hisao, Tadashi Yoshida, and Tadahiko Murata. 2003. “Balance Between Genetic Search and Local Search in Memetic Algorithms for Multiobjective Permutation Flowshop Scheduling.” IEEE Transactions on Evolutionary Computation 7 (2): 204–223.
  • Jiang, Zhongyi, Fangfang Chen, and Huiyan Kang. 2013. “Single-Machine Scheduling Problems with Actual Time-Dependent and Job-Dependent Learning Effect.” European Journal of Operational Research 227 (1): 76–80.
  • Jiang, En-da, and Ling Wang. 2019. “An Improved Multi-Objective Evolutionary Algorithm Based on Decomposition for Energy-Efficient Permutation Flow Shop Scheduling Problem with Sequence-Dependent Setup Time.” International Journal of Production Research 57 (6): 1756–1771.
  • Johnson, Selmer Martin. 1954. “Optimal Two- and Three-Stage Production Schedules with Setup Times Included.” Naval Research Logistics Quarterly 1 (1): 61–68.
  • Kemmoe, Sylverin, Damien Lamy, and Nikolay Tchernev. 2017. “Job-Shop Like Manufacturing System with Variable Power Threshold and Operations with Power Requirements.” International Journal of Production Research 55 (20): 6011–6032.
  • Kim, S. C., and P. M. Bobrowski. 1994. “Impact of Sequence-Dependent Setup Time on Job Shop Scheduling Performance.” The International Journal of Production Research 32 (7): 1503–1520.
  • Lee, Wen-Chiung, and Chin-Chia Wu. 2004. “Minimizing Total Completion Time in a Two-Machine Flowshop with a Learning Effect.” International Journal of Production Economics 88 (1): 85–93.
  • LeGrande, Earl. 1963. “The Development of a Factory Simulation System Using Actual Operating Data.” Management Science 1: 1–19.
  • Li, Hua, P. G. H. Nichols, S. Han, K. J. Foster, Krishnapillai Sivasithamparam, and M. J. Barbetti. 2009. “Resistance to Race 2 and Cross-Resistance to Race 1 of Kabatiella Caulivora in Trifolium Subterraneum and T. Purpureum.” Australasian Plant Pathology 38 (3): 284–287.
  • Li, Xiaoping, Zhi Yang, Rubén Ruiz, Tian Chen, and Shaochun Sui. 2018. “An Iterated Greedy Heuristic for no-Wait Flow Shops with Sequence Dependent Setup Times, Learning and Forgetting Effects.” Information Sciences 453: 408–425.
  • Lu, Chao, Liang Gao, Xinyu Li, Quanke Pan, and Qi Wang. 2017. “Energy-efficient Permutation Flow Shop Scheduling Problem Using a Hybrid Multi-Objective Backtracking Search Algorithm.” Journal of Cleaner Production 144: 228–238.
  • Mansouri, S. Afshin, Emel Aktas, and Umut Besikci. 2016. “Green Scheduling of a Two-Machine Flowshop: Trade-Off Between Makespan and Energy Consumption.” European Journal of Operational Research 248 (3): 772–788.
  • Mao, Yunshi, and Jing Wang. 2019. “Is Green Manufacturing Expensive? Empirical Evidence from China.” International Journal of Production Research 57 (23): 7235–7247.
  • Masmoudi, Oussama, Xavier Delorme, and Paolo Gianessi. 2019. “Job-shop Scheduling Problem with Energy Consideration.” International Journal of Production Economics 216: 12–22.
  • Mirjalili, Seyedali, and Andrew Lewis. 2016. “The Whale Optimization Algorithm.” Advances in Engineering Software 95: 51–67.
  • Montgomery, Douglas C. 2017. Design and Analysis of Experiments. Hoboken, NJ: John Wiley & Sons.
  • Mosheiov, Gur. 2001. “Scheduling Problems with a Learning Effect.” European Journal of Operational Research 132 (3): 687–693.
  • 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.
  • Nowicki, Eugeniusz, and Czesław Smutnicki. 1996. “A Fast Tabu Search Algorithm for the Permutation Flow-Shop Problem.” European Journal of Operational Research 91 (1): 160–175.
  • Osman, Ibrahim H, and C. N. Potts. 1989. “Simulated Annealing for Permutation Flow-Shop Scheduling.” Omega 17 (6): 551–557.
  • Pargar, F., and M. Zandieh. 2012. “Bi-criteria SDST Hybrid Flow Shop Scheduling with Learning Effect of Setup Times: Water Flow-Like Algorithm Approach.” International Journal of Production Research 50 (10): 2609–2623.
  • Qin, Hanzhang, Zhi-Hai Zhang, and Danyu Bai. 2016. “Permutation Flowshop Group Scheduling with Position-Based Learning Effect.” Computers & Industrial Engineering 92: 1–15.
  • Ramezanian, Reza, Mohammad Mahdi Vali-Siar, and Mahdi Jalalian. 2019. “Green Permutation Flowshop Scheduling Problem with Sequence-Dependent Setup Times: A Case Study.” International Journal of Production Research 57 (10): 3311–3333.
  • Riahi, Vahid, Raymond Chiong, and Yuli Zhang. 2020. “A New Iterated Greedy Algorithm for No-Idle Permutation Flowshop Scheduling with the Total Tardiness Criterion.” Computers & Operations Research 117: 104839.
  • 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.
  • Ruiz, Ruben, and José Antonio Vázquez-Rodríguez. 2010. “The Hybrid Flow Shop Scheduling Problem.” European Journal of Operational Research 205 (1): 1–18.
  • Selmair, Maximilian, Thorsten Claus, Marco Trost, Andreas Bley, and Frank Herrmann. 2016. “Job Shop Scheduling With Flexible Energy Prices.” Paper presented at the ECMS.
  • Shao, Weishi, Dechang Pi, and Zhongshi Shao. 2019. “A Pareto-Based Estimation of Distribution Algorithm for Solving Multiobjective Distributed No-Wait Flow-Shop Scheduling Problem with Sequence-Dependent Setup Time.” IEEE Transactions on Automation Science and Engineering 16 (3): 1344–1360.
  • Shen, Liji, Stéphane Dauzère-Pérès, and Janis S Neufeld. 2018. “Solving the Flexible Job Shop Scheduling Problem with Sequence-Dependent Setup Times.” European Journal of Operational Research 265 (2): 503–516.
  • Shrouf, Fadi, Joaquin Ordieres-Meré, Alvaro García-Sánchez, and Miguel Ortega-Mier. 2014. “Optimizing the Production Scheduling of a Single Machine to Minimize Total Energy Consumption Costs.” Journal of Cleaner Production 67: 197–207.
  • Soleimani, Hamed, Hadi Ghaderi, Pei-Wei Tsai, Navid Zarbakhshnia, and Mohsen Maleki. 2020. “Scheduling of Unrelated Parallel Machines Considering Sequence-Related Setup Time, Start Time-Dependent Deterioration, Position-Dependent Learning and Power Consumption Minimization.” Journal of Cleaner Production 249: 119428.
  • Suppapitnarm, A., K. A. Seffen, G. T. Parks, and P. J. Clarkson. 2000. “Simulated Annealing: An Alternative Approach to True Multiobjective Optimization.” Engineering Optimization 33 (1): 33–59.
  • Taillard, Eric. 1990. “Some Efficient Heuristic Methods for the Flow Shop Sequencing Problem.” European Journal of Operational Research 47 (1): 65–74.
  • Tang, Dunbing, Min Dai, Miguel A. Salido, and Adriana Giret. 2016. “Energy-Efficient Dynamic Scheduling for a Flexible Flow Shop Using an Improved Particle Swarm Optimization.” Computers in Industry 81: 82–95.
  • Ulungu, Ekunda Lukata, J. F. P. H. Teghem, P. H. Fortemps, and Daniel Tuyttens. 1999. “MOSA Method: A Tool for Solving Multiobjective Combinatorial Optimization Problems.” Journal of Multicriteria Decision Analysis 8 (4): 221.
  • Wang, Yong, and Lin Li. 2013. “Time-of-use Based Electricity Demand Response for Sustainable Manufacturing Systems.” Energy 63: 233–244.
  • Wang, Jing-Jing, and Ling Wang. 2018. “A Knowledge-Based Cooperative Algorithm for Energy-Efficient Scheduling of Distributed Flow-Shop.” IEEE Transactions on Systems, Man, and Cybernetics: Systems 99: 1–15.
  • Wang, Shijin, Xiaodong Wang, Feng Chu, and Jianbo Yu. 2020. “An Energy-Efficient two-Stage Hybrid Flow Shop Scheduling Problem in a Glass Production.” International Journal of Production Research 58 (8): 2283–2314.
  • Wright, Theodore P. 1936. “Factors Affecting the Cost of Airplanes.” Journal of the Aeronautical Sciences 3 (4): 122–128.
  • Wu, Xueqi, and Ada Che. 2020. “Energy-efficient no-Wait Permutation Flow Shop Scheduling by Adaptive Multi-Objective Variable Neighborhood Search.” Omega 94: 102117.
  • Wu, Chin-Chia, and Wen-Chiung Lee. 2009a. “A Note on the Total Completion Time Problem in a Permutation Flowshop with a Learning Effect.” European Journal of Operational Research 192 (1): 343–347.
  • Wu, Chin-Chia, and Wen-Chiung Lee. 2009b. “Single-Machine and Flowshop Scheduling with a General Learning Effect Model.” Computers & Industrial Engineering 56 (4): 1553–1558.
  • Xin, Xu, Qiangqiang Jiang, Sihang Li, Shuaiyu Gong, and Kang Chen. 2021. “Energy-Efficient Scheduling for a Permutation Flow Shop with Variable Transportation Time Using an Improved Discrete Whale Swarm Optimization.” Journal of Cleaner Production 293: 126121.
  • Yankai, Wang, Wang Shilong, Li Dong, Shen Chunfeng, and Yang Bo. 2021. “An Improved Multi-Objective Whale Optimization Algorithm for the Hybrid Flow Shop Scheduling Problem Considering Device Dynamic Reconfiguration Processes.” Expert Systems with Applications 174: 114793.
  • Zhang, Rui, and Raymond Chiong. 2016. “Solving the Energy-Efficient job Shop Scheduling Problem: A Multi-Objective Genetic Algorithm with Enhanced Local Search for Minimizing the Total Weighted Tardiness and Total Energy Consumption.” Journal of Cleaner Production 112: 3361–3375.
  • Zhang, Biao, Quan-Ke Pan, Liang Gao, Lei-Lei Meng, Xin-Yu Li, and Kun-Kun Peng. 2019. “A Three-Stage Multiobjective Approach Based on Decomposition for an Energy-Efficient Hybrid Flow Shop Scheduling Problem.” IEEE Transactions on Systems, Man, and Cybernetics: Systems 50 (12): 4984–4999.
  • Zheng, Xiao-Long, and Ling Wang. 2016. “A Collaborative Multiobjective Fruit fly Optimization Algorithm for the Resource Constrained Unrelated Parallel Machine Green Scheduling Problem.” IEEE Transactions on Systems, Man, and Cybernetics: Systems 48 (5): 790–800.

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.