A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints

Norelhouda Sekkal () and Fayçal Belkaid ()
Additional contact information
Norelhouda Sekkal: University of Tlemcen
Fayçal Belkaid: University of Tlemcen

Journal of Combinatorial Optimization, No 0, 37 pages

Abstract: 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 R1 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, R1). 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 (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00607-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v::y::i::d:10.1007_s10878-020-00607-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00607-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().