Single-machine scheduling with early and tardy completion costs
- 1 February 1993
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 40 (1) , 85-101
- https://doi.org/10.1002/1520-6750(199302)40:1<85::aid-nav3220400106>3.0.co;2-c
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Minimizing Weighted Absolute Deviation in Single Machine SchedulingIIE Transactions, 1987
- Scheduling Tasks with Due Dates in a Fabrication/Assembly ProcessOperations Research, 1987
- Minimizing mean absolute deviation of completion times about a common due dateNaval Research Logistics Quarterly, 1986
- Single‐ and multiple‐processor models for minimizing completion time varianceNaval Research Logistics Quarterly, 1986
- Manufacturing systems with forbidden early order departureInternational Journal of Production Research, 1984
- Minimizing Variation of Flow Time in Single Machine SystemsManagement Science, 1981
- Minimizing the average deviation of job completion times about a common due dateNaval Research Logistics Quarterly, 1981
- Minimising Waiting Time Variance in the Single Machine ProblemManagement Science, 1977
- An experimental comparison of solution algorithms for the single‐machine tardiness problemNaval Research Logistics Quarterly, 1974
- Algorithms for Solving Production-Scheduling ProblemsOperations Research, 1960