A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint
Year of publication: |
September 2015
|
---|---|
Authors: | Lee, Ju-Yong ; Kim, Yeong-Dae |
Published in: |
Journal of the Operational Research Society : OR. - Basingstoke, Hampshire : Palgrave, ISSN 0030-3623, ZDB-ID 716033-1. - Vol. 66.2015, 9, p. 1542-1554
|
Subject: | scheduling | identical parallel machines | availability constraint | total tardiness | branch and bound | Scheduling-Verfahren | Scheduling problem | Branch-and-Bound | Branch and Bound | Theorie | Theory | Produktionssteuerung | Production control | Operations Research | Operations research | Mathematische Optimierung | Mathematical programming |
-
Ozturk, Onur, (2017)
-
A column generation-based approach for proportionate flexible two-stage no-wait job shop scheduling
Pei, Zhi, (2020)
-
Khoudi, Asmaa, (2020)
- More ...
-
Minimizing the number of trady jobs in a single-machine scheduling problem with periodic maintenance
Lee, Ju-yong, (2012)
-
Machine Learning-Based Dispatching for a Wet Clean Station in Semiconductor Manufacturing
Jeong, Sung-hoon, (2023)
-
A decomposition approach to a multi-period vehicle scheduling problem
Kim, Jung-Ug, (1999)
- More ...