A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop

Applied Mathematical Modelling

Volumn 37, Issue 23, 2013, Pages 9603-9616

  Goldansaz, Seyed Morteza ^a   Jolai, Fariborz ^a   Zahedi Anaraki, Amir Hossein ^a  

^a UNIVERSITY OF TEHRAN   (Iran)

Author keywords

Genetic algorithm; Imperialist competitive algorithm; Makespan; Multi processor open shop scheduling problems; Response surface methodology

Indexed keywords

COMPUTATIONAL RESULTS; IMPERIALIST COMPETITIVE ALGORITHM (ICA); IMPERIALIST COMPETITIVE ALGORITHMS; MAKESPAN; MIXED-INTEGER LINEAR PROGRAMMING; OPEN SHOP SCHEDULING; OPEN SHOP SCHEDULING PROBLEM; RESPONSE SURFACE METHODOLOGY;

GENETIC ALGORITHMS; LINEAR PROGRAMMING; MULTIPROCESSING SYSTEMS; SCHEDULING; SCHEDULING ALGORITHMS; SURFACE PROPERTIES;

PROBLEM SOLVING;

EID: 84885959027     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2013.05.002     Document Type: Article

References (16)

1. Naderi B., Fatemi Ghomi S.M.T., Aminnayeri M., Zandieh M. A contribution and new heuristics for open shop scheduling. Computers & Operations Research 2010, 37:213-221.
2. Low C., Yeh Y. Genetic algorithm-based heuristics for an open shop scheduling problem with setup, processing, and removal times separated. Robotics and Computer-Integrated Manufacturing 2009, 25:314-322.
3. Naderi B., Fatemi Ghomi S.M.T., Aminnayeri M., Zandieh M. Scheduling open shops with parallel machines to minimize total completion time. Journal of Computational and Applied Mathematics 2011, 235:1275-1287.
4. Matta M. A genetic algorithm for the proportionate multiprocessor open shop. Computers & Operations Research 2009, 36:2601-2618.
5. Matta M., Elmaghraby S.E. Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop. European Journal of Operational Research 2010, 201:720-728.
6. Kis T., Werra D., Kubiak W. A projective algorithm for preemptive open shop scheduling with two multiprocessor groups. Operations Research Letters 2010, 38:129-132.
7. Lin H.T., Lee H.T., Pan W.J. Heuristics for scheduling in a no-wait open shop with movable dedicated machines. International Journal of Production Economics 2008, 111:368-377.
8. Werra D., Kis T., Kubiak W. Preemptive open shop scheduling with multiprocessors: polynomial cases and applications. Journal of Scheduling 2008, 11:75-83.
9. Sevastianov S.V., Woeginger G.J. Linear time approximation scheme for the multiprocessor open shop problem. Discrete Applied Mathematics 2001, 114:273-288.
10. Schuurman P., Woeginger G.J. Approximation algorithms for the multiprocessor open shop scheduling problem. Operations Research Letters 1999, 24:157-163.
11. Atashpaz-Gargari E, Lucas C. Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. IEEE Congress, 2007 p. 4661-7.
12. Shokrollahpour E., Zandieh M., Dorri B. A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem. International Journal of Production Research 2011, 49(11):3087-3103.
13. Attar S.F., Mohammadi M., Tavakkoli-Moghaddam R. A novel imperialist competitive algorithm to solve flexible flow shop scheduling problem in order to minimize maximum completion time. International Journal of Computer Applications. 2011, 28(10):27-32.
14. Karimi N., Zandieh M., Najafi A.A. Group scheduling in flexible flow shops: a hybridised approach of imperialist competitive algorithm and electromagnetic-like mechanism. International Journal of Production Research 2011, 49(16):4965-4977.
15. Varmazyar M., Salmasi N. Sequence-dependent flow shop scheduling problem minimising the number of tardy jobs. International Journal of Production Research 2011, 1-16. iFirst.
16. Javadian N., Rezaeian J., Khorshidian H., Rahmani K. Single machine preemptive scheduling by hybridized meta-heuristic approach. IEEE 2011, 750-753.