Low-complexity algorithms for sequencing jobs with a fixed number of job-classes

Computers and Operations Research

Volumn 23, Issue 11, 1996, Pages 1059-1067

  Van Der Veen, Jack A A ^a   Zhang, Shuzhong ^b  

^a NYENRODE BUSINESS UNIVERSITY   (Netherlands)

^b ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; JOB ANALYSIS; MACHINE TOOLS; SCHEDULING; TIME VARYING SYSTEMS;

LOW-COMPLEXITY ALGORITHMS; PARALLEL MACHINES; SEQUENCING JOBS;

MANUFACTURING DATA PROCESSING;

EID: 0030290532     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(96)00016-0     Document Type: Article

References (15)

1. M.H. Al-Haboubi and S.Z. Selim, A sequencing problem in the weaving industry, Eur. J. Opl Res., 66, 65-71 (1993).
2. E. Balas, and P. Toth. Branch and bound methods. In The Traveling Salesman Problem (Edited by E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys) John Wiley & Sons, New York (1985).
3. L. Bianco, R. Rinaldi and A. Sassano: A combinatorial optimization approach to aircraft sequencing problem. In Flow Control of Congested Networks (Edited by A. R. Odoni et al.) NATO-ASI Series 38, 324-339, (1987).
4. L. Bianco, S. Ricciardelli, G. Rinaldi and A. Sassano, Scheduling tasks with sequence-dependent processing times, Naval Res. Logist., 35, 177-184 (1988).
5. R. W. Conway, W. L. Maxwell, and L. W. Miller. Theory of Scheduling. Addison-Wesley, Reading MA (1967).
6. S.S. Cosmadakis and C.H. Papadimitriou, The traveling salesman problem with many visits to a few cities, SIAM J. Computg, 13, 99-108 (1984).
7. G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, Solution of a large-scale traveling salesman problem, Ops Res., 2, 393-410 (1954).
8. M. R. Garey, and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company (1979).
9. P.C. Gilmore and R.E. Gomory, Sequencing a one state-variable machine: a solvable case of the traveling salesman problem, Ops Res., 12, 655-679 (1964).
10. A. ten Have. A new approach to aircraft sequencing. Master's Thesis, Department of Econometrics, University of Groningen, The Netherlands (1992).
11. D.S. Hochbaum and R. Shamir, Strongly polynomial algorithms for the high multiplicity scheduling problem, Ops Res., 39, 648-653 (1991).
12. H.W. Lenstra, Integer programming with a fixed number of variables, Math. Ops Res., 8, 538-548 (1983).
13. H.N. Psaraftis, A dynamic programming approach for sequencing groups of identical jobs, Ops Res., 28, 1347-1359 (1980).
14. A. Schrijver Theory of Linear and Integer Programming. John Wiley, New York (1986).
15. C.S. Tang and E.V. Denardo, Models arising from a flexible manufacturing machine, part I: minimization of the number of tool switches, Ops Res., 36, 767-7771 (1988).