Annals of Operations Research
Separating lifted odd-hole inequalities to solve the index selection problem
Discrete Applied Mathematics
A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Minimizing Total Completion Time Subject to Job Release Dates and Preemption Penalties
Journal of Scheduling
A fast algorithm for single processor scheduling
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
Operations Research Letters
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem
Operations Research Letters
| Hi-index | 0.00 |
We address a class of single-machine, hard scheduling problems with the objective of minimizing the maximum tardiness. The jobs can be preempted, but whenever a job is started or resumed, there is a recovery interval affecting its progress. Such a feature is motivated by certain application environments and generalizes the usual preemption concept. For three different cases of this problem, we propose a heuristic algorithm, based on the partial enumeration of feasible schedules. A packing formulation solved by means of a column generation approach is used to certify the quality of the heuristic solution. An extensive computational experience shows the effectiveness of the approach on different classes of instances and shows that real-size problems can be solved to optimality in an acceptable amount of time.