Preemption in single machine earliness/tardiness scheduling
- First Online:
- Cite this article as:
- Bülbül, K., Kaminsky, P. & Yano, C. J Sched (2007) 10: 271. doi:10.1007/s10951-007-0028-6
- 137 Views
We consider a single machine earliness/tardiness scheduling problem with general weights, ready times and due dates. Our solution approach is based on a time-indexed preemptive relaxation of the problem. For the objective function of this relaxation, we characterize cost coefficients that are the best among those with a piecewise linear structure with two segments. From the solution to the relaxation with these best objective function coefficients, we generate feasible solutions for the original non-preemptive problem. We report extensive computational results demonstrating the speed and effectiveness of this approach.