Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
- 23 August 1996
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 93 (1) , 49-60
- https://doi.org/10.1016/0377-2217(95)00133-6
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobsComputers & Operations Research, 1995
- Parallel-Machine Scheduling Problems with Earliness and Tardiness PenaltiesJournal of the Operational Research Society, 1994
- The parallel machine min-max weighted absolute lateness scheduling problemNaval Research Logistics (NRL), 1994
- On scheduling to minimize earliness-tardiness and batch delivery costs with a common due dateEuropean Journal of Operational Research, 1993
- A note on one-processor scheduling with asymmetric earliness and tardiness penaltiesOperations Research Letters, 1993
- A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due dateComputers & Operations Research, 1992
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due dateComputers & Operations Research, 1991
- Survey of scheduling research involving due date determination decisionsEuropean Journal of Operational Research, 1989
- Determination of an optimal common due date and optimal sequence in a single machine job shopInternational Journal of Production Research, 1988
- An algorithm for the con due-date determination and sequencing problemComputers & Operations Research, 1987