Name
Abstract | ||
|---|---|---|
This paper investigates an issue of rescheduling on identical parallel machines where the original jobs have already been scheduled to minimize the total completion time, when a single set of jobs to be reworked re-arrives and creates a job rework disruption. Two conflicting rescheduling criteria are considered: the total completion time, as the measure of scheduling cost (efficiency); and the number of jobs 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 problem. Two polynomial time algorithms are proposed to lexicographically optimize the two criteria. Besides, the set of all efficient schedules with respect to the two criteria can be also generated in polynomial time. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.cie.2013.02.018 | Computers & Industrial Engineering |
Keywords | Field | DocType |
total completion time,job rework disruption,efficient schedule,conflicting rescheduling criterion,polynomial time,identical parallel-machine,polynomial time algorithm,disruption cost,bi-criteria scheduling problem,original job,rescheduling problem,scheduling | Rework,Mathematical optimization,Job shop scheduling,Scheduling (computing),Schedule,Engineering,Lexicographical order,Time complexity,Operations management | Journal |
Volume | Issue | ISSN |
66 | 1 | 0360-8352 |
Citations | PageRank | References |
5 | 0.52 | 22 |
Authors | ||
2 | ||