Minimizing Weighted Absolute Deviation in Single Machine Scheduling
- 1 December 1987
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 19 (4) , 445-450
- https://doi.org/10.1080/07408178708975418
Abstract
This paper presents a procedure to minimize the total penalty when jobs are scheduled on a single machine subject to earliness and tardiness penalties. This performance criterion has been shown to be non-regular thus, requiring a search among schedules with inserted machine idle time to find a solution. A procedure to optimally insert idle time is also presented.Keywords
This publication has 8 references indexed in Scilit:
- A state-of-art survey of static scheduling research involving due datesOmega, 1984
- Minimizing the sum of absolute lateness in single‐machine and multimachine schedulingNaval Research Logistics Quarterly, 1984
- Minimizing a quadratic function of job lateness on a single machineEngineering Costs and Production Economics, 1983
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling ProblemOperations Research, 1982
- Minimizing the average deviation of job completion times about a common due dateNaval Research Logistics Quarterly, 1981
- Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness PenaltiesOperations Research, 1978
- Optimal Single-Machine Scheduling with Earliness and Tardiness PenaltiesOperations Research, 1977
- Minimizing Total Costs in One-Machine SchedulingOperations Research, 1975