One-machine rescheduling heuristics with efficiency and stability as criteria
Computers and Operations Research
Scheduling in Computer and Manufacturing Systems
Scheduling in Computer and Manufacturing Systems
Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Methods
Journal of Scheduling
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
Scheduling Algorithms
Rescheduling for Multiple New Orders
INFORMS Journal on Computing
On-Line Rescheduling to Minimize Makespan under a Limit on the Maximum Sequence Disruption
SSME '09 Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering
On-Line Rescheduling to Minimize Makespan under a Limit on the Maximum Disruptions
ICMECG '09 Proceedings of the 2009 International Conference on Management of e-Commerce and e-Government
Rescheduling for Job Unavailability
Operations Research
| Hi-index | 0.00 |
We consider the rescheduling on a single machine with release dates to minimize the makespan and total sequence disruption simultaneously. In the literature, a polynomial-time algorithm was presented for minimizing the makespan under a limit on the total sequence disruption. But the algorithm is not strongly polynomial. We present a strongly polynomial-time algorithm for finding all Pareto optimal points of the Pareto optimization problem. Consequently, the rescheduling to minimize the makespan under a limit on the total sequence disruption can be solved in a strongly polynomial time.