Reducing efficiently the search tree for multiprocessor job-shop scheduling problems
Year of publication: |
2013
|
---|---|
Authors: | Carballo, Lester ; Vakhania, Nodari ; Werner, Frank |
Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 51.2013, 23/24 (1/15.12.), p. 7105-7119
|
Subject: | job shop scheduling | branch-and-bound algorithm | solution tree | dominance relations | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Produktionssteuerung | Production control | Operations Research | Operations research |
-
A hybrid PSO-GA algorithm for job shop scheduling in machine tool production
Liu, Li-Lan, (2015)
-
An exact algorithm for the single machine problem with unavailability periods
Gharbi, Anis, (2015)
-
Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns
Xiong, Jian, (2013)
- More ...
-
Scheduling unrelated machines with two types of jobs
Vakhania, Nodari, (2014)
-
Vakhania, Nodari, (2009)
-
A note on the proof of the complexity of the little-preemptive open-shop problem
Shchepin, Evgeny V., (2011)
- More ...