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

Mathematical Programming, Series B

Volumn 82, Issue 1-2, 1998, Pages 235-254

  Van Der Veen, Jack A A ^a   Woeginger, Gerhard J ^b   Zhang, Shuzhong ^c  

^a NYENRODE BUSINESS UNIVERSITY   (Netherlands)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^c ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

Polynomial time algorithm; Single machine scheduling; Traveling Salesman Problem

Indexed keywords

EID: 0012930632     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01585874     Document Type: Article

References (17)

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.
2. R. van Dal, Special Cases of the Traveling Salesman Problem, Ph.D.Thesis, University of Groningen, Wolters-Noordhoff Groningen, 1992.
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.
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).
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.
6. B.H. Ahn, J.H. Hyun, Single facility multi-class job sequencing, Computers and Operations Research 17 (1990) 265-272.
7. J.N.D. Gupta, Single facility scheduling with multiple job classes, European Journal of Operational Research 8 (1988) 42-45.
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.
9. C.L. Monma, C.N. Potts, On the complexity of scheduling with batch setup times, Operations Research 37 (1989) 798-804.
10. C.N. Potts, Scheduling two job classes on a single machine, Computers and Operations Research 18 (1991) 411-415.
11. H.N. Psaraftis, A dynamic programming approach for sequencing groups of identical jobs, Operations Research 28 (1980) 1347-1359.
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.
13. L. Bianco, S. Ricciardelli, G. Rinaldi, A. Sassano, Scheduling tasks with sequence dependent processing times, Naval Research Logistics 35 (1988) 177-184.
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.
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.
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.
17. M.O. Ball, M.J. Magazine, Sequencing of insertions in printed circuit board assembly, Operations Research 36 (1988) 192-201.