A hybridisation of metaheuristics for flow shop scheduling

International Journal of Advanced Manufacturing Technology

Volumn 24, Issue 5-6, 2004, Pages 376-380

  Haq, A Noorul ^a   Ravindran, D ^a   Aruna, V ^a   Nithiya, S ^a  

^a NATIONAL INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Ant system; Flow shop scheduling; Genetic algorithm; Hybridisation; Makespan; Metaheuristics

Indexed keywords

CONSTRAINT THEORY; GENETIC ALGORITHMS; HEURISTIC METHODS; ITERATIVE METHODS; MACHINING; PROBABILITY; PROBLEM SOLVING;

ANT SYSTEM; FLOW SHOP SCHEDULING; HYBRIDIZATION; MAKESPAN; METAHEURISTICS;

SCHEDULING;

EID: 7044229813     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00170-003-1665-3     Document Type: Article

References (14)

1. Janiak A (1997) Flow shop scheduling with resources-exact and approximation algorithms. In: Proceedings of the International Symposium on Mathematical Programming, Lausanne, Switzerland, 24-29 August 1997
2. Hall LA (1994) A polynomial approximation scheme for a constrained flow shop scheduling problem. Math Oper Res 19:68-85
3. Glass CA, Potts CN, Strusevich VA (1997) Shop scheduling with batching to minimise the makespan. In: Proceedings of the International Symposium on Mathematical Programming, Lausanne, Switzerland, 24-29 August 1997
4. Shusuke O, Chie W and Hajime I (2001) A new parallel algorithm for n job m machine flow shop scheduling problem and its implementation on nCUBE2. IPSJ SIGNotes Contents Software Engineering, Abs. No. 087-006
5. Haouari M. Daouas T (1999) Optimal scheduling of the 3 machine assembly type flow shop. RAIRO Ops Res 33(4):439-445
6. Portugal V, Scott JL (2001) The asymptotic convergence of some FSS heuristics. Asia Pacific J Op Res 18(2):
7. Stutzle T, Hoos H (1999) MAX-MIN Ant System and Local Search for the Traveling Salesman Problem. In: Proceedings of the IEEE Conference on Evolution Computation (ICEC '97), Indianapolis, IN, 13-16 April 1999
8. Aggoune R (2001) Minimizing the makespan for flow shop scheduling problem with availability constraints. In: Proceedings of ORP 2001, Paris, France, 26-29 September 2001
9. Kobayashi S, Ono I, Yamamura M (1995) An efficient GA for job shop scheduling problems. In: Proceedings of ICGA '95, Pittsburgh, PA, 15-19 July 1995
10. Shaw KJ, Fleming PJ (1996) An initial study of practical multiobjective production scheduling using genetic algorithms. In: Proceedings of the International Conference on Control '96, University of Exeter, UK, 2-5 September 1996
11. Chen S, Smith S (1999) Improving GAs by search space reduction with application to flow shop scheduling. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '99), Orlando, FL, 14-17 July 1999
12. Hurink J, Knust S (2001) Makespan minimization for flow shop problems with transportation times and a single robot. Disc Appl Math 112:199-216
13. Dorigo M, Colorni A (1996) The ant system: optimization by a colony of co-operating agents. IEEE Trans Sys Man Cybern 26(1):1-13
14. Gen M, Cheng R (1996) Genetic algorithms and engineering design. Ashikaga Institute of Technology, Wiley, New York