Assignment and Scheduling in Flexible Job-Shops by Hierarchical Optimization
Authors:
- Imed KacemImed Kacem
- Abdelkader El KamelAKAbdelkader El Kamel
- Pierre BornePBPierre Borne
- 1 July 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)
- Vol. 37 (4) , 652-661
Abstract
In this paper, we propose a new hierarchical method for the flexible job-shop scheduling problem (FJSP). This approach is mainly adapted to a job-shop problem (JSP) with high flexibility and is based on the decomposition of the problem in an assignment subproblem and a sequencing subproblem. For the first subproblem, we propose two methods: the first one is based successively on a heuristic approach and a local search; the second one, however, is based on a branch-and-bound algorithm. The quality of the assignment is evaluated by a lower bound. For the second subproblem we apply a hybrid genetic algorithm to deal with the sequencing problem. Computational tests are finally presented.Keywords
This publication has 19 references indexed in Scilit:
- Genetic algorithm operators restricted to precedent constraint sets: genetic algorithm designs with or without branch and bound approach for solving scheduling problems with disjunctive constraints2002
- A genetic algorithm for general machine scheduling problems2002
- Steiner-optimal data replication in tree networks with storage costs2002
- Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problemsIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 2002
- Hybrid evolutionary techniques for the maintenance scheduling problemIEEE Transactions on Power Systems, 2000
- A Fast Taboo Search Algorithm for the Job Shop ProblemManagement Science, 1996
- Tabu search for the job-shop scheduling problem with multi-purpose machinesOR Spectrum, 1994
- An introduction to simulated evolutionary optimizationIEEE Transactions on Neural Networks, 1994
- Routing and scheduling in a flexible job shop by tabu searchAnnals of Operations Research, 1993
- An Algorithm for Solving the Job-Shop ProblemManagement Science, 1989