Skip to main content
SpringerLink
Log in

A two-stage Ant Colony optimization algorithm to minimize the makespan on unrelated parallel machines—part II: enhancements and experimentations

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

In a previous paper (Arnaout et al in J Intell Manuf 21:693–701, 2010), an Ant Colony optimization (ACO I) algorithm was introduced for minimizing the schedule’s makespan on unrelated parallel machines with sequence-dependent setup times. Optimal solutions for small instances of this problem were obtained by solving a mixed integer program. However, for larger instances (up to 10 machines and 120 jobs), heuristic and approximate algorithms were necessary to reach solutions in reasonable computational times. ACO I’s performance was evaluated by comparing its solutions to solutions obtained using Tabu Search and MetaRaPS (metaheuristic for Randomized Priority Search). While the results indicated that ACO I outperformed the other heuristics, it also showed that MetaRaPS had a better performance when all ratios of N/M (jobs to machines ratio) were considered. In this paper, we introduce an enhanced ACO which will be referred to as ACO II and compare its performance to other existing and new algorithms including ACO I, MetaRaPS, and SA. The extensive and expanded experiments conducted prove the superiority of the enhanced ACO II.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Al-Salem A. (2004) Scheduling to minimize makespan on unequal parallel machines with sequence dependent setup times. Engineering Journal of the University of Qatar 17: 177–187

    Google Scholar 

  • Allahverdi A., Gupta J. N. D., Aldowaisan T. (1999) A review of scheduling research involving setup considerations. Omega 27: 219–239

    Article  Google Scholar 

  • Arnaout J.-P., Rabadi G., Musa R. (2010) A two-stage ant colony optimization to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. Journal of Intelligent Manufacturing 21: 693–701

    Article  Google Scholar 

  • Azizoglu M., Kirca O. (1999) Scheduling jobs on unrelated parallel machines to minimize regular total cost functions. IIE Transactions 31: 153–159

    Google Scholar 

  • Bank J., Werner F. (2001) Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties. Mathematical and Computer Modelling 33: 363–383

    Article  Google Scholar 

  • Bruno L. G., Coffman E. G., Sethi R. (1974) Scheduling independent tasks to reduce mean finishing time. Communications of the ACM 17: 382–387

    Article  Google Scholar 

  • Dhaenens-Flipo C. (2001) A bicriterion approach to deal with a constrained single-objective problem. International Journal of Production Economics 74: 93–101

    Article  Google Scholar 

  • Fanjul-Peyro L., Ruiz R. (2010) Iterated greedy local search methods for unrelated parallel machine scheduling. European Journal of Operational Research 207: 55–69

    Article  Google Scholar 

  • Franca P. M., Gendreau M., Laporte G., Muller F. M. (1996) A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times. International Journal of Production Economics 43: 79–89

    Article  Google Scholar 

  • Garey M. R., Johnson D. S. (1979) Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco

    Google Scholar 

  • Ghirardi M., Potts C. N. (2004) Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach. European Journal of Operational Research 165(2): 457–467

    Article  Google Scholar 

  • Glass C. A., Potts C. N., Shade P. (1994) Unrelated parallel machine scheduling using local search. Mathematical and Computer Modeling 20(2): 41–52

    Article  Google Scholar 

  • Guinet A. (1990) Textile production systems: A succession of non-identical parallel processor shops. Journal of the Operational Research Society 42: 655–671

    Google Scholar 

  • Hariri A. M. A., Potts C. N. (1991) Heuristics for scheduling unrelated parallel machines. Computers and Operations Research 18(3): 323–331

    Article  Google Scholar 

  • Helal M., Rabadi G., Al-Salem A. (2006) A tabu search algorithm to minimize the makespan for unrelated parallel machines scheduling problem with setup times. International Journal of Operations Research 3(3): 182–192

    Google Scholar 

  • Horn W. A. (1973) Minimizing average flow time with parallel machines. Operations Research 21: 846–847

    Article  Google Scholar 

  • Karp R. M. (1972) Reducibility among combinatorial problems. In: Miller R. E., Tatcher J. W. (Eds.), Complexity of computer computations. Plenum Press, New York, pp 85–103

    Chapter  Google Scholar 

  • Kim D. W., Kim K. H., Jang W., Chen F. F. (2002) Unrelated parallel machine scheduling with setup times using simulated annealing. Robotics and Computer Integrated Manufacturing 18(3–4): 223–231

    Article  Google Scholar 

  • Kim D. W., Na D. G., Chen F. F. (2003) Unrelated parallel machine scheduling with setup times and total weighted tardiness objective. Robotics and Computer Integrated Manufacturing 19(1–2): 173–181

    Article  Google Scholar 

  • Kurz M. E., Askin R. G. (2001) Heuristic scheduling of parallel machines with sequence-dependent set-up times. International Journal of Production Research 39: 3747–3769

    Article  Google Scholar 

  • Logendran R., McDonellb B., Smuckera B. (2007) Scheduling unrelated parallel machines with sequence-dependent setups. Computers Operations Research 34: 3420–3438

    Article  Google Scholar 

  • NIST/SEMATECH. (2012). e-Handbook of statistical methods. http://www.itl.nist.gov/div898/handbook/. Accessed June 25, 2008.

  • Oguz C., Zinder Y., Do V., Janiak A., Lichtenstein M. (2004) Hybrid flow-shop scheduling problems with multiprocessor task systems. European Journal of Operational Research 152(1): 115–131

    Article  Google Scholar 

  • Rabadi G., Moraga R., Al-Salem A. (2006) Heuristics for the unrelated parallel machine scheduling problem with setup times. Journal of Intelligent Manufacturing 17: 85–97

    Article  Google Scholar 

  • Radhakrishnan S., Ventura J. A. (2000) Simulated annealing for parallel machine scheduling with earliness/tardiness penalties and sequence-dependent set-up times. International Journal of Production Research 38: 2233–2252

    Article  Google Scholar 

  • Randhawa S. U., Kuo C. H. (1997) Evaluating scheduling heuristics for non-identical parallel processors. International Journal of Production Research 35: 969–981

    Article  Google Scholar 

  • Ross P. (1996) Taguchi techniques for quality engineering. McGraw Hill, New York

    Google Scholar 

  • SchedulingResearch. (2005). http://SchedulingResearch.com. Accessed in December, 2009.

  • Shyu S. J., Lin B. M. T., Yin P. Y. (2004) Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time. Computers and Industrial Engineering 47: 181–193

    Article  Google Scholar 

  • Srivastava B. (1997) An effective heuristic for minimizing makespan on unrelated parallel machines. Journal of the Operational Research Society 49: 886–894

    Google Scholar 

  • Weng M., Lu J., Ren H. (2001) Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective. International Journal of Production Economics 70: 215–226

    Article  Google Scholar 

  • Ying K.-C., Lin S.-W. (2006) Multiprocessor task scheduling in multistage hybrid flow-shops: An ant colony system approach. International Journal of Production Research 44(16): 3161–3177

    Article  Google Scholar 

  • Ying, K.-C., Lee, Z.-J., & Lin, S.-W. (2010). Makespan minimization for scheduling unrelated parallel machines with setup times. Journal of Intelligent Manufacturing (online first).

  • Zhu X., Wilhelm W. (2006) Scheduling and lot sizing with sequence-dependent setup: A literature review. IIE Transactions 38: 987–1007

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Industrial and Mechanical Engineering Department, Lebanese American University, Byblos, Lebanon

    Jean-Paul Arnaout

  2. DuPont, Wilmington, DE, USA

    Rami Musa

  3. Engineering Management and Systems Engineering Department, Old Dominion University, Norfolk, VA, 23529, USA

    Ghaith Rabadi

Authors
  1. Jean-Paul Arnaout
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rami Musa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ghaith Rabadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jean-Paul Arnaout.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Arnaout, JP., Musa, R. & Rabadi, G. A two-stage Ant Colony optimization algorithm to minimize the makespan on unrelated parallel machines—part II: enhancements and experimentations. J Intell Manuf 25, 43–53 (2014). https://doi.org/10.1007/s10845-012-0672-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-012-0672-3

Keywords

Search

Navigation