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 | Durchlaufzeit | Lead time | Heuristik | Heuristics |
-
Thevenin, Simon, (2017)
-
Accelerating the calculation of makespan used in scheduling improvement heuristics
Madraki, Golshan, (2021)
-
Flow shop scheduling problem with conflict graphs
Tellache, Nour El Houda, (2018)
- More ...
-
A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
Ng, C. T., (2010)
-
Nong, Q. Q., (2008)
-
An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
Nong, Q. Q., (2008)
- More ...