On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
- 1 November 1993
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 70 (3) , 272-288
- https://doi.org/10.1016/0377-2217(93)90239-j
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin CaseOperations Research, 1992
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due dateComputers & Operations Research, 1991
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due DateOperations Research, 1991
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due DateOperations Research, 1991
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) TimeManagement Science, 1991
- Sequencing with Earliness and Tardiness Penalties: A ReviewOperations Research, 1990
- Batching to Minimize Flow Times on One MachineManagement Science, 1987