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: | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Durchlaufzeit | Lead time |
-
Ozturk, Onur, (2017)
-
Cheng, Mingbao, (2015)
-
Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
Mensendiek, Arne, (2015)
- More ...
-
On the complexity of bi-criteria scheduling on a single batch processing machine
Liu, L. L., (2010)
-
Bicriterion scheduling with equal processing times on a batch processing machine
Liu, L. L., (2009)
-
Single-machine scheduling with deteriorating jobs under a series-parallel graph contraint
Wang, Ji-Bo, (2008)
- More ...