One-machine rescheduling heuristics with efficiency and stability as criteria
Computers and Operations Research
Flow-time performance of modified scheduling heuristics in a dynamic rescheduling environment
CIE '96 Proceedings of the 19th international conference on Computers and industrial engineering
Simulation modeling of a dynamic job shop rescheduling with machine availability constraints
Proceedings of the 23rd international conference on on Computers and industrial engineering
Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Methods
Journal of Scheduling
Dynamic rescheduling that simultaneously considers efficiency and stability
Computers and Industrial Engineering
Operations Research
Two Machine Scheduling under Disruptions with Transportation Considerations
Journal of Scheduling
Multicriteria Scheduling: Theory, Models and Algorithms
Multicriteria Scheduling: Theory, Models and Algorithms
Heuristic procedures for reactive project scheduling
Computers and Industrial Engineering
Capability of cumulative delay based reactive scheduling for job shops with machine breakdowns
Computers and Industrial Engineering
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Rescheduling for Multiple New Orders
INFORMS Journal on Computing
Principles of Sequencing and Scheduling
Principles of Sequencing and Scheduling
A survey of dynamic scheduling in manufacturing systems
Journal of Scheduling
Rescheduling for Job Unavailability
Operations Research
Genetic algorithms for match-up rescheduling of the flexible manufacturing systems
Computers and Industrial Engineering
| Hi-index | 0.00 |
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.