Complexity of shop-scheduling problems with fixed number of jobs : a survey
Year of publication: |
2007
|
---|---|
Authors: | Brucker, Peter ; Sotskov, Jurij Nazarovič ; Werner, Frank |
Published in: |
Mathematical methods of operations research. - Berlin : Springer, ISSN 1432-2994, ZDB-ID 1310695-8. - Vol. 65.2007, 3, p. 461-481
|
Subject: | Scheduling-Verfahren | Scheduling problem |
Description of contents: | Abstract [doi.org] |
-
Biogeography-based optimisation for flexible manufacturing system scheduling problem
Shahla Paslar, (2015)
-
Pattern mining-based pruning strategies in stochastic local searches for scheduling problems
Laurent, Arnaud, (2022)
-
Cui, Haijuan, (2022)
- More ...
-
On the complexity of two machine job-shop scheduling with regular objective functions
Brucker, Peter, (1997)
-
Preemptive job-shop scheduling problems with a fixed number of jobs
Brucker, Peter, (1999)
-
On the calculation of the stability radius of an optimal or an approximate schedule
Sotskov, Jurij Nazarovič, (1997)
- More ...