Preemption in single machine earliness/tardiness scheduling

Authors:
Kerem Bülbül;Philip Kaminsky;Candace Yano
Affiliations:
Manufacturing Systems and Industrial Engineering, Sabancı University, Istanbul, Turkey;Industrial Engineering and Operations Research, University of California, Berkeley, USA;Industrial Engineering and Operations Research, University of California, Berkeley, USA and Haas School of Business, University of California, Berkeley, USA
Venue:
Journal of Scheduling
Year:
2007

Citing 12
Cited 12

A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden

Computers and Operations Research
One-processor scheduling with symmetric earliness and tardiness penalties

Mathematics of Operations Research
Single machine scheduling to minimize mean absolute lateness: a heuristic solution

Computers and Operations Research
Sequencing with earliness and tardiness penalties: a review

Operations Research
Formulating the single machine sequencing problem with release dates as a mixed integer program

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights

Computers and Operations Research
A branch and bound procedure to minimize mean absolute lateness on a single processor

Computers and Operations Research
Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties

Mathematics of Operations Research
Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review

Operations Research
Generating Experimental Data for Computational Testing with Machine Scheduling Applications

Operations Research
The One-Machine Problem with Earliness and Tardiness Penalties

Journal of Scheduling
The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions

INFORMS Journal on Computing

A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

Journal of Scheduling
A new model for the preemptive earliness-tardiness scheduling problem

Computers and Operations Research
New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling

INFORMS Journal on Computing
A gravitational task model with arbitrary anchor points for target sensitive real-time applications

Real-Time Systems
Non-approximability of just-in-time scheduling

Journal of Scheduling
Fast neighborhood search for the single machine earliness-tardiness scheduling problem

Computers and Operations Research
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem

Computers and Operations Research
A genetic algorithm for JIT single machine scheduling with preemption and machine idle time

Expert Systems with Applications: An International Journal
The one-machine just-in-time scheduling problem with preemption

Discrete Optimization
A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time

Journal of Scheduling
A linear programming-based method for job shop scheduling

Journal of Scheduling
Single machine scheduling with controllable processing times to minimize total tardiness and earliness

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

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.