Advertisement

Mathematical Programming

, Volume 82, Issue 1–2, pp 235–254 | Cite as

Sequencing jobs that require common resources on a single machine: A solvable case of the TSP

  • Jack A. A. van der Veen
  • Gerhard J. Woeginger
  • Shuzhong Zhang
Article

Abstract

In this paper a one-machine scheduling model is analyzed wheren different jobs are classified intoK groups depending on which additional resource they require. The change-over time from one job to another consists of the removal time or of the set-up time of the two jobs. It is sequence-dependent in the sense that the change-over time is determined by whether or not the two jobs belong to the same group. The objective is to minimize the makespan. This problem can be modeled as an asymmetric Traveling Salesman Problem (TSP) with a specially structured distance matrix. For this problem we give a polynomial time solution algorithm that runs in O(n logn) time. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

Keywords

Single machine scheduling Traveling Salesman Problem Polynomial time algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    P.C. Gilmore, E.L. Lawler, D.B. Shmoys, Well-solved special cases, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.), The Traveling Salesman Problem, Wiley-Interscience, NY, 1985, pp. 87–143.Google Scholar
  2. [2]
    R. van Dal, Special Cases of the Traveling Salesman Problem, Ph.D.Thesis, University of Groningen, Wolters-Noordhoff Groningen, 1992.Google Scholar
  3. [3]
    J.A.A. van der Veen, Solvable Cases of the Traveling Salesman Problem with Various Objective Functions, Ph.D. Thesis, University of Groningen, 1992.Google Scholar
  4. [4]
    R.E. Burkard, V.G. Deineko, R. van Dal, J.A.A. van der Veen, G.J. Woeginger, Solvable Cases of the Traveling Salesman Problem: A Survey, SIAM Review (to appear).Google Scholar
  5. [5]
    P.C. Gilmore, R.E. Gomory, Sequencing a one-state-variable machine: A solvable case of the Traveling Salesman Problem, Operations Research 12 (1964) 655–679.Google Scholar
  6. [6]
    B.H. Ahn, J.H. Hyun, Single facility multi-class job sequencing, Computers and Operations Research 17 (1990) 265–272.Google Scholar
  7. [7]
    J.N.D. Gupta, Single facility scheduling with multiple job classes, European Journal of Operational Research 8 (1988) 42–45.Google Scholar
  8. [8]
    J.N.D. Gupta, J.C. Ho, J.A.A. van der Veen, Single machine bi-criteria scheduling with customer orders and multiple job classes, Annals of Operations Research 70 (1997) 127–144.Google Scholar
  9. [9]
    C.L. Monma, C.N. Potts, On the complexity of scheduling with batch setup times, Operations Research 37 (1989) 798–804.Google Scholar
  10. [10]
    C.N. Potts, Scheduling two job classes on a single machine, Computers and Operations Research 18 (1991) 411–415.Google Scholar
  11. [11]
    H.N. Psaraftis, A dynamic programming approach for sequencing groups of identical jobs, Operations Research 28 (1980) 1347–1359.Google Scholar
  12. [12]
    L. Bianco, G. Rinaldi, A. Sassano, A combinatorial optimization approach to aircraft sequencing problem, in: A.R. Odini et al. (Eds.), Flow Control of Congested Networks, NATO-ASI Series 38, 1987, pp. 324–339.Google Scholar
  13. [13]
    L. Bianco, S. Ricciardelli, G. Rinaldi, A. Sassano, Scheduling tasks with sequence dependent processing times, Naval Research Logistics 35 (1988) 177–184.Google Scholar
  14. [14]
    J.A.A. van der Veen, S. Zhang, Low-complexity algorithms for sequencing jobs with a fixed number of job-classes, Computers and Operations Research 23 (1996) 1059–1067.Google Scholar
  15. [15]
    S.S. Cosmadakis, C.H. Papadimitriou, The Traveling Salesman Problem with many visits to few cities, SIAM Journal on Computing 13 (1984) 99–108.Google Scholar
  16. [16]
    H.W. Hamacher, Combinatorial optimization problems motivated by robotic assembly problems, in: M. Akgul (Ed.), Combinatorial Optimization, NATO ASI Series F 82, 1992, pp. 187–198.Google Scholar
  17. [17]
    M.O. Ball, M.J. Magazine, Sequencing of insertions in printed circuit board assembly, Operations Research 36 (1988) 192–201.Google Scholar

Copyright information

© The Mathematical Programming Society, Inc. 1998

Authors and Affiliations

  • Jack A. A. van der Veen
    • 1
  • Gerhard J. Woeginger
    • 2
  • Shuzhong Zhang
    • 3
  1. 1.Centre for Supply Chain ManagementNijenrode University, The Netherlands Business SchoolBreukelenThe Netherlands
  2. 2.TU GrazInstitut für Mathematik BGrazAustria
  3. 3.Econometric InstituteErasmus University RotterdamRotterdamThe Netherlands

Personalised recommendations