Algorithms for minclique scheduling problems
- 10 January 1997
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 72 (1-2) , 115-139
- https://doi.org/10.1016/s0166-218x(96)00040-6
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- New results on the completion time variance minimizationDiscrete Applied Mathematics, 1995
- Completion time variance minimization on a single machine is difficultOperations Research Letters, 1993
- State-of-the-Art Survey—Constrained Nonlinear 0–1 ProgrammingINFORMS Journal on Computing, 1993
- A user's guide to tabu searchAnnals of Operations Research, 1993
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due DateOperations Research, 1991
- CON due-date determination and sequencingComputers & Operations Research, 1990
- An Algorithm for Partitioning the Nodes of a GraphSIAM Journal on Algebraic Discrete Methods, 1982
- Minimizing Variation of Flow Time in Single Machine SystemsManagement Science, 1981
- Complexity of Machine Scheduling ProblemsPublished by Elsevier ,1977
- A Functional Equation and its Application to Resource Allocation and Sequencing ProblemsManagement Science, 1969