A new model for the preemptive earliness-tardiness scheduling problem
Year of publication: |
2009
|
---|---|
Authors: | Runge, Nina ; Sourd, Francis |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 36.2009, 7, p. 2242-2249
|
Subject: | timing algorithm | One-machine earliness-tardiness scheduling problem | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm |
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
Online algorithms for scheduling two parallel machines with a single server
Jiang, Yiwei, (2015)
-
An ant colonial optimisation approach for no-wait permutation flow shop scheduling
Khan, Ahitsham Shad, (2017)
- More ...
-
A multiobjective branch-and-bound framework : application to the biobjective spanning tree problem
Sourd, Francis, (2008)
-
Sakuraba, Celso S., (2009)
-
Single machine scheduling with forbidden start times
Billaut, Jean-Charles, (2009)
- More ...