A fixed interval due-date scheduling problem with earliness and due-date costs
From MaRDI portal
Publication:1127177
DOI10.1016/0377-2217(93)E0291-5zbMath0927.90045OpenAlexW2093432382MaRDI QIDQ1127177
Publication date: 13 August 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0291-5
Related Items (4)
On the fixed interval due-date scheduling problem ⋮ Finding efficient make-to-order production and batch delivery schedules ⋮ Algorithm for minimizing weighted earliness penalty in single-machine problem ⋮ Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
Cites Work
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- Minimizing the average deviation of job completion times about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Minimizing mean absolute deviation of completion times about a common due date
- The Weighted Total Tardiness Problem with Fixed Shipping Times and Overtime Utilization
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- A Single Machine Model for Determination of Optimal Due Dates and Sequence
This page was built for publication: A fixed interval due-date scheduling problem with earliness and due-date costs
