Preemptive just-in-time scheduling problem on uniform parallel machines with time-dependent learning effect and release dates

Keyvan Shokoufi, Javad Rezaeian, Babak Shirazi and Iraj Mahdavi

International Journal of Operational Research, 2019, vol. 34, issue 3, 339-368

Abstract: This paper considers uniform parallel machines scheduling problem with time-dependent learning effects, release dates, allowable preemption and machine idle time to minimise the total weighted earliness and tardiness penalties which is known to be strongly NP-hard. To solve this problem, this research proposes a mixed integer nonlinear programming (MINLP) model. Afterward, in order to find the best solution in an effective solution space, a dominant set is proposed for the length of the schedule experimentally. Also, based on the allowable idle time, a new time-dependent learning model on parallel machines is proposed. Furthermore, a genetic algorithm (GA) and a hybrid of genetic algorithm and particle swarm optimisation (HGA-PSO) are proposed. Taguchi method is applied to calibrate the parameters of the proposed algorithms. Finally, the computational results are provided to compare the results of the algorithms. Then, the efficiency of the proposed algorithms is discussed.

Keywords: just-in-time scheduling; uniform parallel machines; time-dependent learning effect; preemption; machine idle time; release date. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=98311 (text/html)
Access to full text is restricted to subscribers.

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:ids:ijores:v:34:y:2019:i:3:p:339-368

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().