Scheduling with release dates on a single machine to minimize total weighted completion time
- 1 May 1992
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 36 (3) , 213-231
- https://doi.org/10.1016/0166-218x(92)90255-9
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Formulating the single machine sequencing problem with release dates as a mixed integer programDiscrete Applied Mathematics, 1990
- Minimizing Weighted Completion Times with DeadlinesOperations Research, 1985
- An algorithm for single machine sequencing with release dates to minimize total weighted completion timeDiscrete Applied Mathematics, 1983
- The one-machine sequencing problemEuropean Journal of Operational Research, 1982
- 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
- On n/1/F̄ dynamic deterministic problemsNaval Research Logistics Quarterly, 1979
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956