Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
Year of publication: |
2013
|
---|---|
Authors: | Wan, Long ; Yuan, Jinjiang |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 41.2013, 4, p. 363-365
|
Subject: | Scheduling-Verfahren | Scheduling problem | Produktionsplanung | Production planning | Branch-and-Bound | Branch and Bound |
-
Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness
Moslehi, G., (2009)
-
Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
Detienne, Boris, (2010)
-
A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times
Mazdeh, Mohammad Mahdavi, (2008)
- More ...
-
Online bounded-batch scheduling to minimize total weighted completion time on parallel machines
Ma, Ran, (2014)
-
Wan, Long, (2015)
-
Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
Wan, Long, (2013)
- More ...