Skip to main content
SpringerLink
Log in
Book cover

Proceedings of the Institute of Industrial Engineers Asian Conference 2013 pp 79–87Cite as

Ant Colony Optimization Algorithms for Unrelated Parallel Machine Scheduling with Controllable Processing Times and Eligibility Constraints

  • Conference paper
  • First Online:

Abstract

In this paper, we consider the problem of scheduling jobs on unrelated parallel machines with eligibility constraints, where job-processing times are controllable through the allocation of a nonrenewable common resource, and can be modeled by a linear resource consumption function. The objective is to assign the jobs to the machines and to allocate the resource so that the makespan is minimized. We provide an exact formulation of the addressed problem as an integer programming model. As the problem has been proven to be NP-hard even for the fixed job-processing times, two ant colony optimization (ACO) algorithms based on distinct procedures, respectively, are also presented and analyzed. Numerical results show that both the proposed algorithms are capable of solving large-sized problems within reasonable computational time and accuracy.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  • Blum C, Dorigo M (2004) The hyper-cube framework for ant colony optimization. IEEE Trans Syst Man Cybern 34(2):1161–1172

    Article  Google Scholar 

  • Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53–66

    Article  Google Scholar 

  • Jansen K, Mastrolilli M (2004) Approximation schemes for parallel machine scheduling problems with controllable processing times. Comput Oper Res 31:1565–1581

    Article  MathSciNet  MATH  Google Scholar 

  • Jozefowska J, Mika M, Rozycki R (2002) A heuristic approach to allocating the continuous resource in discrete continuous scheduling problems to minimize the makespan. J Sched 5:487–499

    Article  MathSciNet  MATH  Google Scholar 

  • Lenstra JK, Shmoys DB, Tardos E (1990) Approximation algorithms for scheduling unrelated parallel machines. Math Program 46:259–271

    Article  MathSciNet  MATH  Google Scholar 

  • Mokhtari H, Abadi INK, Cheraghalikhani A (2010) A multi-objective flow shop scheduling with resource-dependent processing times: trade-off between makespan and cost of resources. Int J Prod Res 49(19):5851–5875

    Article  Google Scholar 

  • Shabtay D, Kaspi (2006) Parallel machine scheduling with a convex resource consumption function. Eur J Oper Res 173:92–107

    Article  MathSciNet  MATH  Google Scholar 

  • Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discrete Appl Math 155:1643–1666

    Article  MathSciNet  MATH  Google Scholar 

  • Su LH, Lien CY (2009) Scheduling parallel machines with resource-dependent processing times. Int J Prod Econ 117(2):256–266

    Article  Google Scholar 

Download references

Acknowledgments

This work is partially supported by the National Science Council under Grant NSC-101-2221-E-224-070. The authors also gratefully acknowledge the helpful comments and suggestions of the reviewers, which have improved the presentation.

Author information

Authors and Affiliations

  1. Institute of Industrial Engineering and Management, National Yunlin University of Science and Technology, Yunlin, Taiwan, Republic of China

    Chinyao Low

  2. Department of Industrial Engineering and Management, National Chiao Tung University, Hsinchu, Taiwan, Republic of China

    Rong-Kwei Li & Guan-He Wu

Authors
  1. Chinyao Low
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rong-Kwei Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guan-He Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chinyao Low .

Editor information

Editors and Affiliations

  1. and Technology, Department of Industrial Management, National Taiwan University of Science, Taipei, 10607, Taiwan

    Yi-Kuei Lin

  2. and Technology, Department of Industrial Management, National Taiwan University of Science, Taipei, 10607, Taiwan

    Yu-Chung Tsao

  3. and Technology, Department of Industrial Management, National Taiwan University of Science, Taipei, 10607, Taiwan

    Shi-Woei Lin

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media Singapore

About this paper

Cite this paper

Low, C., Li, RK., Wu, GH. (2013). Ant Colony Optimization Algorithms for Unrelated Parallel Machine Scheduling with Controllable Processing Times and Eligibility Constraints. In: Lin, YK., Tsao, YC., Lin, SW. (eds) Proceedings of the Institute of Industrial Engineers Asian Conference 2013. Springer, Singapore. https://doi.org/10.1007/978-981-4451-98-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-981-4451-98-7_10

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-4451-97-0

  • Online ISBN: 978-981-4451-98-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation