Advertisement

Parallel Servers Scheduling with Dynamic Sequence-Dependent Setup Time

  • Thanh-Cong Dinh
  • Hyerim Bae
Part of the Smart Innovation, Systems and Technologies book series (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.

Keywords

Dynamic sequence-dependent setup time task scheduling parallel servers multiple servers mixed integer programming multi-depot multiple asymmetric traveling salesmen (MmATSP) 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.004CrossRefGoogle Scholar
  2. 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.023MathSciNetMATHCrossRefGoogle Scholar
  3. 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 ExperimentationGoogle Scholar
  4. 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
  5. 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.049MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Business & Service Computing Lab., Industrial EngineeringPusan National UniversityGeumjong-guSouth Korea

Personalised recommendations