《2016 On the identical parallel-machine rescheduling with job rework disruption 》.pdf

Computers Industrial Engineering 66 (2013) 186–198 Contents lists available at SciVerse ScienceDirect Computers Industrial Engineering journal homepage: /locate/caie On the identical parallel-machine rescheduling with job rework disruption q Le Liu, Hong Zhou ⇑ School of Economics and Management, Beihang University, Beijing 100191, People’s Republic of China a r t i c l e i n f o a b s t r a c t Article history: This paper investigates an issue of rescheduling on identical parallel machines where the original jobs Received 22 September 2011 have already been scheduled to minimize the total completion time, when a single set of jobs to be Received in revised form 25 July 2012 reworked re-arrives and creates a job rework disruption. Two conflicting rescheduling criteria are consid- Accepted 23 February 2013 ered: the total completion time, as the measure of scheduling cost (efficiency); and the number of jobs Available online 5 March 2013 assigned to different machines in the original schedule and newly generated schedule, as the measure of disruption cost (stability). Further, the rescheduling problem is defined as a bi-criteria scheduling Keywords: problem. Two polynomial time algorithms are proposed to lexicographically optimize the two criteria. Scheduling Besides, the set of all efficient schedules with respect to the two criter