Minimising the total weighted tardiness and instability for the parallel machine re-scheduling problem with deadlines and ready times Online publication date: Wed, 30-Sep-2015
by Sezgin Kaplan; Ghaith Rabadi
International Journal of Planning and Scheduling (IJPS), Vol. 2, No. 2, 2015
Abstract: The parallel machine rescheduling problem (PMRP) assumes that the jobs have different ready times and due date-to-deadline windows. PMRP can be defined as updating the existing schedule after being disrupted by job-related events including the arrival of new jobs, departure of an existing job, and changes to job priority. In PMRP, bi-criteria objective function is considered to simultaneously minimise both the total weighted tardiness (schedule quality) and schedule instability. We first formulate the PMRP by revising and extending the mixed integer linear programming (MILP) model of the scheduling problem in Kaplan and Rabadi (2012). Five heuristic algorithms, namely MetaRE, BestINSERT, SEPRE, LSHIFT and SHUFFLE, are introduced to handle the bi-objective PMRP using the developed algorithms by Kaplan and Rabadi (2012, 2013). Experiments have been conducted for small size (12 jobs) and large size (60 size) problems for different types of disruptions.
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 Planning and Scheduling (IJPS):
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