A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
| Year of publication: |
2010
|
|---|---|
| Authors: | Xu, Kailiang ; Feng, Zuren ; Ke, Liangjun |
| Published in: |
Annals of operations research. - Dordrecht, The Netherlands : Springer Nature B.V., ISSN 0254-5330, ZDB-ID 252629-3. - Vol. 181.2010, p. 303-324
|
| Subject: | Scheduling-Verfahren | Scheduling problem | Produktionssteuerung | Production control | Branch-and-Bound | Branch and Bound | Theorie | Theory | Durchlaufzeit | Lead time | Operations Research | Operations research |
-
Ozturk, Onur, (2017)
-
Minimizing maximum tardiness on a single machine with family setup times and machine disruption
Molaee, Ehsan, (2021)
-
Penz, Louise, (2023)
- More ...
-
Single machine scheduling with total tardiness criterion and convex controllable processing times
Xu, Kailiang, (2011)
-
Xu, Kailiang, (2010)
-
A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
Ke, Liangjun, (2013)
- More ...