Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
Authors:
- 1 October 2001
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 29 (3) , 141-148
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time ProblemOperations Research, 1998
- Minimizing average completion time in the presence of release datesMathematical Programming, 1998
- Optimal on-line algorithms for single-machine scheduling1996
- Scheduling with release dates on a single machine to minimize total weighted completion timeDiscrete Applied Mathematics, 1992
- A time indexed formulation of non-preemptive single machine scheduling problemsMathematical Programming, 1992
- Formulating the single machine sequencing problem with release dates as a mixed integer programDiscrete Applied Mathematics, 1990
- An algorithm for single machine sequencing with release dates to minimize total weighted completion timeDiscrete Applied Mathematics, 1983
- Scheduling of a single machine to minimize total weighted completion time subject to release datesNaval Research Logistics Quarterly, 1982
- Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow TimeSIAM Journal on Computing, 1981
- Complexity of Machine Scheduling Problems1977