Discrepancy search for the flexible job shop scheduling problem
Year of publication: |
2010
|
---|---|
Authors: | Hmida, Abir Ben ; Haouari, Mohamed ; Huguet, Marie-José ; Lopez, Pierre |
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. 37.2010, 12, p. 2192-2201
|
Subject: | Scheduling-Verfahren | Scheduling problem | Produktionssteuerung | Production control | Algorithmus | Algorithm |
-
A better heuristic for preemptive parallel machine scheduling with batch set-up times
Chen, Bo, (1992)
-
Scheduling jobs on parallel machines, each with a unit-capacity buffer
Baas, S. M., (1990)
-
Approximation algorithms for scheduling a single machine to ninimize total late work
Potts, Chris N., (1991)
- More ...
-
Climbing depth-bounded discrepancy search for solving hybrid flow shop problems
Hmida, Abir Ben, (2007)
-
Climbing depth-bounded discrepancy search for solving hybrid flow shop problems
Hmida, Abir Ben, (2007)
-
Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search
Hmida, Abir Ben, (2011)
- More ...