An exact approach to early/tardy scheduling with release dates

Authors:
Jorge M. S. Valente;Rui A. F. S. Alves
Affiliations:
Faculdade de Economia, Universidade do Porto, Porto, Portugal;Faculdade de Economia, Universidade do Porto, Porto, Portugal
Venue:
Computers and Operations Research
Year:
2005

Citing 4
Cited 9

The single machine early/tardy problem

Management Science
Scheduling with release dates on a single machine to minimize total weighted completion time

Discrete Applied Mathematics
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem

Computers and Operations Research
Improved heuristics for the early/tardy scheduling problem with no idle time

Computers and Operations Research

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

Journal of Scheduling
On single-machine scheduling without intermediate delays

Discrete Applied Mathematics
An improved particle swarm optimization algorithm for flowshop scheduling problem

Information Processing Letters
An alternate two phases particle swarm optimization algorithm for flow shop scheduling problem

Expert Systems with Applications: An International Journal
A hybrid alternate two phases particle swarm optimization algorithm for flow shop scheduling problem

Computers and Industrial Engineering
The circular discrete particle swarm optimization algorithm for flow shop scheduling problem

Expert Systems with Applications: An International Journal
Single-machine scheduling with no idle time and release dates to minimize a regular criterion

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

Computers and Industrial Engineering
Homogeneously non-idling schedules of unit-time jobs on identical parallel machines

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we consider the single machine earliness/tardiness scheduling problem with different release dates and no unforced idle time. The problem is decomposed into weighted earliness and weighted tardiness subproblems. Lower bounding procedures are proposed for each of these subproblems, and the lower bound for the original problem is the sum of the lower bounds for the two subproblems. The lower bounds and several versions of a branch-and-bound algorithm are then tested on a set of randomly generated problems, and instances with up to 30 jobs are solved to optimality. To the best of our knowledge, this is the first exact approach for the early/tardy scheduling problem with release dates and no unforced idle time.