Optimal common due-date with limited completion time deviation
From MaRDI portal
Given a set of n jobs with deterministic processing times and the same ready times, the problem is to find the optimal common flow allowance \(k^*\) for the common due-date assignment method, and the optimal job sequence \(\sigma^*\) to minimize a penalty function of missing due- dates. It is assumed that penalty will not occur if the deviation of job completion from the due-date is sufficiently small. Three lemmas are presented and a numerical example is provided to illustrate the use of the results to determine the optimal solution to the due-date determination and sequencing problem.
Recommendations
- Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
- On Optimal Common Due-Date Determination
- Minimizing the average deviation of job completion times about a common due-date: An extension
- An algorithm for the CON due-date determination and sequencing problem
- Optimal common due-date with completion time tolerance
Cites work
- A Simulation Study of Operating Policies in a Hypothetical Dual-Constrained Job Shop
- A Simulation Study of Predictable Due-Dates
- Analytical determination of optimal TWK due-dates in a job shop
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Due Date Assignment for Production Systems
- Minimizing the average deviation of job completion times about a common due date
- Minimizing the average deviation of job completion times about a common due-date: An extension
- On Optimal Common Due-Date Determination
- Optimal due-date assignment in a job shop†
- Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
- Single- and multiple-processor models for minimizing completion time variance
Cited in
(33)- An algorithm for the CON due-date determination and sequencing problem
- Minimizing the maximum deviation of job completion time about a common due-date
- A note on ``Minimizing the maximum deviation of job completion time about a common due-date
- Survey of scheduling research involving due date determination decisions
- A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date
- Determination of common due window location in a single machine scheduling problem
- Due window scheduling for parallel machines
- Earliness-tardiness scheduling problems with a common delivery window
- Optimal common due-date with completion time tolerance
- Single machine scheduling with common due data assignment in a group technology environment
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
- Two-stage medical supply chain scheduling with an assignable common due window and shelf life
- Single machine scheduling with symmetric earliness and tardiness penalties
- Soft due window assignment and scheduling of unit-time jobs on parallel machines
- An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time
- Scheduling with monotonous earliness and tardiness penalties
- Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
- Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times
- A two-echelon inventory optimization model with demand time window considerations
- Single-machine scheduling problems simultaneous with deteriorating and learning effects under a deteriorating maintenance consideration
- scientific article; zbMATH DE number 4003886 (Why is no real title available?)
- On Optimal Common Due-Date Determination
- Minimizing the average deviation of job completion times about a common due-date: An extension
- Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times
- Minimizing total earliness and tardiness on re-entrant batch processing machine with time windows
- Single-machine scheduling with a common due window
- Parallel machine scheduling with a common due window
- Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration
- A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing
- On scheduling around large restrictive common due windows
- Optimal common due-date with limited completion time
- CON due-date determination and sequencing
This page was built for publication: Optimal common due-date with limited completion time deviation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097833)
