Abstract
Permutation flow shop scheduling problem (PFSP) is a well-known problem in the scheduling literature. Even though many multi-objective PFSPs are presented in the literature with the objectives related to production efficiency and customer satisfaction, studies considering energy consumption and environmental effects in scheduling is very seldom. In this paper, the trade-off between total energy consumption (TEC) and total flow time is investigated in a PFSP environment, where the machines are assumed to operate at varying speed levels. A multi-objective mixed integer linear programming model is proposed based on a speed-scaling strategy. Due to the NP-complete nature of the problem, an efficient multi-objective iterated greedy (IGALL) algorithm is also developed. The performance of IGALL is compared with model performance in terms of quality and cardinality of the solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Fang, K., Uhan, N., Zhao, F., Sutherland, J.W.: A new approach to scheduling in manufacturing for power consumption and carbon footprint reduction. J. Manuf. Syst. 30(4), 234–240 (2011)
Gahm, C., Denz, F., Dirr, M., Tuma, A.: Energy-efficient scheduling in manufacturing companies: a review and research framework. Eur. J. Oper. Res. 248, 744–757 (2016)
Mouzon, G., Yildirim, M.B., Twomey, J.: Operational methods for the minimization of energy consumption of manufacturing equipment. Int. J. Prod. Res. 45(18–19), 4247–4271 (2007)
Ding, J.-Y., Song, S., Wu, C.: Carbon-efficient scheduling of flowshops by multi-objective optimization. Eur. J. Oper. Res. 248, 758–771 (2016)
Mansouri, S.A., Aktas, E., Besikci, U.: Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption. Eur. J. Oper. Res. 248, 772–788 (2016)
Lu, C., Gao, L., Li, X., Pan, Q.K., Wang, Q.: Energy-efficient permutation flow shop scheduling problem using a hybrid multi-objective backtracking search algorithm. J. Clean. Prod. 144, 228–238 (2017)
Manne, A.S.: On the job-shop scheduling problem. Oper. Res. 8, 219–223 (1960)
Mavrotas, G.: Effective implementation of the e-constraint method in multi-objective mathematical programming problems. Appl. Math. Comput. 213, 455–465 (2009)
Dubois-Lacoste, J., Pagnozzi, F., Stützle, T.: An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem. Comput. Oper. Res. 81, 160–166 (2017)
Nawaz, M., Enscore Jr., E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA 11(1), 91–95 (1983)
Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64, 278–285 (1993)
Coello, C.A.C., Van Veldhuizen, D.A., Lamont, G.B.: Evolutionary Algorithms for Solving Multi-Objective Problems, vol. 5. Springer, New York (2007). https://doi.org/10.1007/978-0-387-36797-2
Tan, K.C., Goh, C.K., Yang, Y., Lee, T.H.: Evolving better population distribution and exploration in evolutionary multi-objective optimization. Eur. J. Oper. Res. 171, 463–495 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Öztop, H., Fatih Tasgetiren, M., Türsel Eliiyi, D., Pan, QK. (2018). Green Permutation Flowshop Scheduling: A Trade- off- Between Energy Consumption and Total Flow Time. In: Huang, DS., Gromiha, M., Han, K., Hussain, A. (eds) Intelligent Computing Methodologies. ICIC 2018. Lecture Notes in Computer Science(), vol 10956. Springer, Cham. https://doi.org/10.1007/978-3-319-95957-3_79
Download citation
DOI: https://doi.org/10.1007/978-3-319-95957-3_79
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-95956-6
Online ISBN: 978-3-319-95957-3
eBook Packages: Computer ScienceComputer Science (R0)