Skip to main content
SpringerLink
Log in
Book cover

Intelligent Decision Technologies pp 79–87Cite as

Parallel Servers Scheduling with Dynamic Sequence-Dependent Setup Time

  • Conference paper

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 16))

Abstract

This paper deals with task scheduling problem in industrial consulting companies with dynamic sequence-dependent setup time by considering parallel servers (or multiple servers). The problem is transformed to multi-depot multiple asymmetric traveling salesman problem (MmATSP). A mixed integer programming model is formulated to minimize sum of tardiness time and sum of setup time.

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   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega-International Journal of Management Science 34(3), 209–219 (2006), doi:10.1016/j.omega.2004.10.004

    Article  Google Scholar 

  • Chung, C.-S., Flynn, J., Kirca, Ö.: A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems. European Journal of Operational Research 174(1), 1–10 (2006), doi:10.1016/j.ejor.2004.12.023

    Article  MathSciNet  MATH  Google Scholar 

  • Cirasella, J., Johnson, D.S., McGeoch, L.A., Zhang, W.: The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests. Paper presented at the Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation

    Google Scholar 

  • Dinh, T.C., Wang, Z., Bae, H., Ryu, K.: Task Scheduling with Dynamic Sequence-dependent Setup Time using Asymmetric TSP. In: International Conference on Flexible Automation and Intelligent Manufacturing 21st, Taiwan (2011)

    Google Scholar 

  • Plateau, M.C., Rios-Solis, Y.A.: Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations. European Journal of Operational Research 201(3), 729–736 (2010), doi:10.1016/j.ejor.2009.03.049

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Business & Service Computing Lab., Industrial Engineering, Pusan National University, 30-san Jangjeon-dong, Geumjong-gu, Busan, 609-735, South Korea

    Thanh-Cong Dinh & Hyerim Bae

Authors
  1. Thanh-Cong Dinh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hyerim Bae
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thanh-Cong Dinh .

Editor information

Editors and Affiliations

  1. Graduate School of Information,, Production & Systems (IPS), Waseda University, Hibikino 2-7, Kitakyushu, 808-0135, Japan

    Junzo Watada

  2. Graduate School of Information Science, Nagoya University, Furo-cho, Nagoya, 464-8601, Japan

    Toyohide Watanabe

  3. Sellinger School of Business and, Management, Loyola University Maryland, Charles Street 4501 N, Baltimore, 21210, USA

    Gloria Phillips-Wren

  4. KES International, PO Box 2115, Shoreham-by-Sea, BN43 9AF, United Kingdom

    Robert J. Howlett

  5. , School of Electrical and Information, University of South Australia, 5095, Adelaide, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dinh, TC., Bae, H. (2012). Parallel Servers Scheduling with Dynamic Sequence-Dependent Setup Time. In: Watada, J., Watanabe, T., Phillips-Wren, G., Howlett, R., Jain, L. (eds) Intelligent Decision Technologies. Smart Innovation, Systems and Technologies, vol 16. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29920-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29920-9_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29919-3

  • Online ISBN: 978-3-642-29920-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation