Single-machine scheduling with deteriorating jobs under a series-parallel graph contraint
Year of publication: |
2008
|
---|---|
Authors: | Wang, Ji-Bo ; Ng, C. T. ; Cheng, T. C. E. |
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. 35.2008, 8, p. 2684-2693
|
Subject: | Scheduling-Verfahren | Scheduling problem | Graphentheorie | Graph theory | Branch-and-Bound | Branch and Bound |
-
Lateness minimization in pairwise connectivity restoration problems
Averbakh, Igor, (2018)
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
Two-machine flow shop problem with unit-time operations and conflict graph
Tellache, Nour El Houda, (2017)
- More ...
-
A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
Ng, C. T., (2010)
-
Single machine scheduling to minimize total weighted tardiness
Cheng, T. C. E., (2005)
-
On the single machine total tardiness problem
Tian, Z. J., (2005)
- More ...