Assignment and Scheduling in Flexible Job-Shops by Hierarchical Optimization.

Authors :: Zribi, Nozha
Kacem, Imed
El Kamel, Abdelkader
Borne, Pierre
Source :: IEEE Transactions on Systems, Man & Cybernetics: Part C - Applications & Reviews. Jul2007, Vol. 37 Issue 4, p652-661. 10p. 4 Black and White Photographs, 7 Charts.
Publication Year :: 2007
Abstract: The article presents a study which proposes a new hierarchical method for the flexible job-shop scheduling problem (FJSP). The FJSP is a nondeterministic polynomial-time hard since it is an extension of the job-shop scheduling problem. The first method proposed is based successively on a heuristic approach and a local search. The second one is based on a branch-and-bound algorithm.

Subjects :: *SCHEDULING
*JOB shops
*ALGORITHMS
*ASSIGNMENT problems (Programming)
*HEURISTIC

Language :: English
ISSN :: 10946977
Volume :: 37
Issue :: 4
Database :: Academic Search Index
Journal :: IEEE Transactions on Systems, Man & Cybernetics: Part C - Applications & Reviews
Publication Type :: Academic Journal
Accession number :: 25724714
Full Text :: https://doi.org/10.1109/TSMCC.2007.897494