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 | Theorie | Theory | Produktionssteuerung | Production control | Branch-and-Bound | Branch and Bound | Operations Research | Operations research |
-
Lee, Ju-Yong, (2015)
-
Solution algorithms to minimise the total family tardiness for job shop scheduling with job families
Yu, Jae-Min, (2018)
-
Ozturk, Onur, (2017)
- More ...
-
Online bounded-batch scheduling to minimize total weighted completion time on parallel machines
Ma, Ran, (2014)
-
Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
Wan, Long, (2013)
-
Online bounded-batch scheduling to minimize total weighted completion time on parallel machines
Ma, Ran, (2014)
- More ...