Preemption in Single Machine Earliness / Tardiness Scheduling

@inproceedings{Blbl2002PreemptionIS,
  title={Preemption in Single Machine Earliness / Tardiness Scheduling},
  author={Kerem B{\"u}lb{\"u}l and Philip Kaminsky and Candace Yano},
  year={2002}
}
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… CONTINUE READING
Highly Cited
This paper has 65 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 42 extracted citations

65 Citations

0510'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 65 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 38 references

Just-in-time scheduling with inventory holding costs

  • K. Bülbül
  • PhD thesis,
  • 2002
Highly Influential
10 Excerpts

Complexity of machine scheduling problems

  • J. Lenstra, A. Rinnooy Kan, P. Brucker
  • Annals of Discrete Mathematics,
  • 1977
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…