A branch and bound algorithm for the cyclic job-shop problem with transportation
Year of publication: |
2012
|
---|---|
Authors: | Brucker, Peter ; Burke, Edmund K. ; Groenemeyer, Sven |
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. 39.2012, 12, p. 3200-3214
|
Subject: | Theorie | Theory | Branch-and-Bound | Branch and Bound | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Operations Research | Operations research |
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
-
Li, Chu-Min, (2017)
-
Srirangacharyulu, B., (2013)
- More ...
-
A shift sequence based approach for nurse scheduling and a new benchmark dataset
Brucker, Peter, (2010)
-
Personnel scheduling : models and complexity
Brucker, Peter, (2011)
-
A shift sequence based approach for nurse scheduling and a new benchmark dataset
Brucker, Peter, (2010)
- More ...