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 | Theorie | Theory | Branch-and-Bound | Branch and Bound | Durchlaufzeit | Lead time | Operations Research | Operations research | Produktionssteuerung | Production control |
-
Yamashiro, Hirochika, (2021)
-
Minimization of maximum lateness on parallel machines with a single server and job release dates
Elidrissi, Abdelhak, (2024)
-
Srirangacharyulu, B., (2013)
- More ...
-
Single machine scheduling with total tardiness criterion and convex controllable processing times
Xu, Kailiang, (2011)
-
Xu, Kailiang, (2010)
-
Single machine scheduling with total tardiness criterion and convex controllable processing times
Xu, Kailiang, (2011)
- More ...