Journal of Scheduling

, Volume 10, Issue 4, pp 271–292

Preemption in single machine earliness/tardiness scheduling

Article

DOI: 10.1007/s10951-007-0028-6

Cite this article as:
Bülbül, K., Kaminsky, P. & Yano, C. J Sched (2007) 10: 271. doi:10.1007/s10951-007-0028-6

Abstract

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.

Keywords

Single-machine schedulingEarlinessTardinessPreemptionTransportation problem

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Kerem Bülbül
    • 1
  • Philip Kaminsky
    • 2
  • Candace Yano
    • 2
    • 3
  1. 1.Manufacturing Systems and Industrial EngineeringSabancı UniversityIstanbulTurkey
  2. 2.Industrial Engineering and Operations ResearchUniversity of CaliforniaBerkeleyUSA
  3. 3.Haas School of BusinessUniversity of CaliforniaBerkeleyUSA