Parallel Servers Scheduling with Dynamic Sequence-Dependent Setup Time
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.
KeywordsDynamic sequence-dependent setup time task scheduling parallel servers multiple servers mixed integer programming multi-depot multiple asymmetric traveling salesmen (MmATSP)
Unable to display preview. Download preview PDF.
- 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
- 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