A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
Year of publication: |
2010
|
---|---|
Authors: | Ng, C. T. ; Wang, Ji-Bo ; Cheng, T. C. E. ; Liu, L. L. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 37.2010, 1, p. 83-90
|
Subject: | Scheduling-Verfahren | Scheduling problem | Branch-and-Bound | Branch and Bound | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Heuristik | Heuristics |
-
An exact algorithm for the preemptive single machine scheduling of equal-length jobs
Fomin, Artem, (2022)
-
Lee, Jun-ho, (2021)
-
Joo, B.-J., (2009)
- More ...
-
Bicriterion scheduling with equal processing times on a batch processing machine
Liu, L. L., (2009)
-
On the complexity of bi-criteria scheduling on a single batch processing machine
Liu, L. L., (2010)
-
Single-machine scheduling with deteriorating jobs under a series-parallel graph contraint
Wang, Ji-Bo, (2008)
- More ...