Earliness-tardiness scheduling with distinct due dates

Francis Sourd
Safia Kedad-Sidhoum

Preprint

An efficient algorithm for the earliness-tardiness scheduling problem.

Code

The code contains a branch-and-bound and a heuristic (iterated search) to solve the earliness-tardiness scheduling problems with distinct due dates and release dates.

It can be compiled with MSVC7 (with etresrelax.vcproj) and with gcc (with /bin/makefile).

Syntax:

Usage : etresrel.exe command arguments
  generate nbJobs releaseFactor tardinessFactor rangeFactor
  timing filename
  heur filename [number of runs]
  bnb filename [UB]
  lb filename

Download

Instances

Format:

NumberOfJobs
p1 r1 d1 alpha1 beta1
p2 r2 d2 alpha2 beta2
...
pn rn dn alphan betan

Works based on these instances