Preemptive just-in-time scheduling problem on uniform parallel machines with time-dependent learning effect and release dates Online publication date: Thu, 14-Mar-2019
by Keyvan Shokoufi; Javad Rezaeian; Babak Shirazi; Iraj Mahdavi
International Journal of Operational Research (IJOR), Vol. 34, No. 3, 2019
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook