Scheduling to minimize weighted earliness and tardiness about a common due-date
From MaRDI portal
Publication:1186924
DOI10.1016/0305-0548(91)90023-KzbMath0744.90041OpenAlexW2085481101MaRDI QIDQ1186924
Jay B. Ghosh, Prabuddha De, Charles E. Wells
Publication date: 28 June 1992
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(91)90023-k
sequencingexact algorithmsingle processordue-dateindependent jobspseudo- polynomial complexitysum of weighted absolute deviations of job completion times
Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Single machine \(\text{MAD}/T_{\max}\) problem with a common due date ⋮ A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios ⋮ On the general solution for a class of early/tardy problems ⋮ A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems ⋮ Determination of fault-tolerant fabric-cutting schedules in a just-in-time apparel manufacturing environment ⋮ Application of genetic algorithm to stochastic single machine scheduling problem with earliness and tardiness costs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- CON due-date determination and sequencing
- Scheduling about a common due date with earliness and tardiness penalties
- A V-shape property of optimal schedule of jobs about a common due date
- An algorithm for the CON due-date determination and sequencing problem
- Scheduling around a small common due date
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- 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
- Single- and multiple-processor models for minimizing completion time variance
- A Generalized Model of Optimal Due-Date Assignment by Linear Programming
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- Determination of an optimal common due date and optimal sequence in a single machine job shop
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- Single-machine scheduling to minimize absolute deviation of completion times from a common due date
- On the Assignment of Optimal Due Dates
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Note—A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date
- Discrete-Variable Extremum Problems
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
