A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effec
- PDF / 2,824,048 Bytes
- 37 Pages / 439.37 x 666.142 pts Page_size
- 116 Downloads / 227 Views
A multi‑objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints Norelhouda Sekkal1 · Fayçal Belkaid1
© Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract Production systems are subject to machine deterioration and resource consumption constraints. The deterioration increases the processing time which leads to an increase in resource consumption. In this study, we investigate and model the behavior of a parallel machine scheduling problem with respect to the processing time. The machine is subject to deterioration and includes two resource consumption constraints. The first resource R1 controls the processing time so that additional amounts of R1 decrease the processing time. The second R2 is controlled by the actual processing time so that R2 consumption is a linear function of the actual processing time. The increment of R 1 consumption leads to processing time and so R2 decrement. Solving this problem consists in finding the optimal schedule that will minimize both makespan and resources cost. This paper provides a mathematical programming model. In fact, due to the deterioration effect and the two resource consumptions, solving such a problem may be very difficult and requires a large computational time. In this paper, we introduce a multi objective simulated annealing (MOSA) in order to solve the combinatorial optimization problem related to finding the best combination (machine, job, position, R 1). Literally the best jobs assignment and resources allocation so that makespan and resources cost are minimized. In order to improve the quality of the results we also developed a 2-steps algorithm by decomposing the original problem into two sub problems: an assignment problem and a resources allocation problem. Some simulations were performed to analyze the performances of the two algorithms. The results show that the 2-steps algorithm is very efficient and outperforms MOSA. Keywords Parallel machine · Deterioration · Resources cost · Makespan · MOSA · 2-Steps algorithm
* Fayçal Belkaid [email protected]‑tlemcen.dz; [email protected] Extended author information available on the last page of the article
13
Vol.:(0123456789)
Journal of Combinatorial Optimization
1 Introduction Scheduling machines is a decision-making process that is used in many manufacturing and service industries. It studies the construction of machine processing schedules for a set of jobs. The aim is to warrant the processing of every job as well as, the optimization of a given mono or multi objective function. In a carpentry workshop, the equipment machines may be a wood cutting machine or, wood carving. In a construction site, this may be a concrete mixer or a mason. In an airport, check-in counter may be considered as a machine. So, any system producing goods or providing services may be viewed as a scheduling problem. Several scheduling problems under several constraints exist (Pinedo 2016). In
Data Loading...
