Parallel-machine rescheduling with job unavailability and rejection

Dujuan Wang, Yunqiang Yin and T.C.E. Cheng

Omega, 2018, vol. 81, issue C, 246-260

Abstract: We study the scheduling problem where a set of jobs has already been scheduled for processing on identical parallel machines to minimize the total completion time under the assumption that all the jobs are available at time zero. However, before processing begins, some jobs are delayed and become unavailable at time zero, so all the jobs need to be rescheduled with a view to not causing excessive schedule disruption with respect to the original schedule. To reduce the negative impact of job unavailability and achieve an acceptable service level, one option in rescheduling the jobs is to reject a subset of the jobs at a cost (the rejection cost). Three criteria are involved: the total completion time of the accepted jobs in the adjusted schedule, the degree of disruption measured by the maximum completion time disruption to any accepted job between the original and adjusted schedules, and the total rejection cost. The overall objective is to minimize the former criterion, while keeping the objective values of the latter two criteria to no greater than the given limits. We present two exact methods to solve the problem: (i) A dynamic programming based approach, establishing that the problem is NP-hard in the ordinary sense when the number of machines is fixed. (ii) An enhanced branch-and-price method that includes several features such as execution of the differential evolution algorithm for finding good initial feasible solutions and solving the pricing sub-problem, inclusion of reduced cost fixing during the inner iterations of the algorithm, and use of a heuristic procedure for constructing a good integer feasible solution. We perform extensive computational experiments to assess the efficiency of the proposed algorithms. The computational results demonstrate that the incorporated enhancements greatly improve the performance of the algorithm.

Keywords: Scheduling; Branch-and-price; Dynamic programming; Differential evolution (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0305048317301950
Full text for ScienceDirect subscribers only

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:eee:jomega:v:81:y:2018:i:c:p:246-260

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.omega.2018.04.008

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().