Algorithms for minclique scheduling problems

Discrete Applied Mathematics

Volumn 72, Issue 1-2, 1997, Pages 115-139

  Jurisch, Bernd ^a   Kubiak, Wieslaw ^a   Józefowska, Joanna ^a  

^a NONE

Author keywords

Dynamic programming; Minimum weighted clique; Single multiple machine scheduling; Spectral algorithms; Tabu search

Indexed keywords

EID: 0003186182     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00040-6     Document Type: Article

References (23)

1. E.R. Barnes, An algorithm for partitioning the nodes of a graph, SIAM J. Algebra Discrete Math. 3 (1982) 541-550.
2. E.R. Barnes and A.J. Hoffman, Partitioning, spectra, and linear programming, in: R.W. Pulleyblank, ed., Progress in Combinatorial Optimization (Academic Press, Canada, 1984) 13-25.
3. M. Blum, R. Floyd, V. Pratt, R. Rivest and R. Tarjan, Time bound on selection, J. Comput. and System Sci. 7 (1972) 240-267.
4. P. De, J.B. Gosh and C.E. Wells, CON due-date determination and sequencing, Comput. Oper. Res. 17 (1990) 333-342.
5. P. De, J.B. Gosh and C.E. Wells, On the minimization of completion time variance with bi-criteria extension, Oper. Res. 40 (1992) 1148-1155.
6. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).
7. F. Glover, E. Taillard and D. De Werra, A user's guide to Tabu search, Ann. Oper. Res. 41 (1993) 3-28.
8. N.G. Hall and M.E. Posner, Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date, Oper. Res. 39 (1991) 836-846.
9. P. Hansen, B. Jaumard and V. Mathon, Constrained nonlinear 0-1 programming, ORSA J. Comput. 5 (1993) 97-119.
10. R.A. Horn and C.A. Johnson, Matrix Analysis (Cambridge Univ. Press, Cambridge, 1985).
11. J. Józefowska and W. Kubiak, Spectral algorithms for the completion time variance problem, Working Paper, Faculty of Business Administration, Memorial University of Newfoundland (1993).
12. H.G. Kahlbacher, SWEAT - a program for scheduling with earliness and tardiness penalties, European J. Oper. Res. 43 (1989) 111-112.
13. J.J Kanet, Minimizing variation of flow time in single machine systems, Management Sci. 27 (1981) 1453-1459.
14. N. Karmakar and R.M. Karp, The differencing method of set partitioning, Report UCB/CSD 82/113, Computer Science Division, Univ. of California, Berkeley (1982)
15. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher, eds., Complexity of Computer Computations (Plenum Press, New York, 1972) 85-103.
16. W. Kubiak, New results on the completion time variance minimization, Discrete Applied Math. 58 (1995) 157-168.
17. W. Kubiak, Completion time variance minimization on a single machine is difficult, Oper. Res. Lett. 14 (1993) 49-59.
18. E.L. Lawler and J.M. Moore, A functional equation and its application to resource allocation and machine scheduling problems, Management Sci. 16 (1969) 77-84.
19. J.K. Lenstra, A.H.G. Rinnooy Kan and P. Brucker, Complexity of machine scheduling problems, Ann. Discrete Math. 1 (1977) 343-362.
20. S. Martello and P. Toth, Knapsack Problems (John Wiley, Chichester, 1990).
21. B. Mohar and S. Poljak, Eigenvalues in combinatorial optimization, preprint (1992).
22. F. Rendl and H. Wolkowicz, A projection technique for partitioning the nodes of a graph, Research Report, University of Waterloo (1990).
23. W.E. Smith, Various optimizers for single-stage production, Naval Res. Logist. Quart. 18 (1956) 295-305.