On the general solution for a class of early/tardy problems
From MaRDI portal
Publication:1207204
DOI10.1016/0305-0548(93)90070-YzbMath0794.90021OpenAlexW2080122513MaRDI QIDQ1207204
Jay B. Ghosh, Prabuddha De, Charles E. Wells
Publication date: 1 April 1993
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(93)90070-y
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items
A multi-agent system for the weighted earliness tardiness parallel machine problem ⋮ A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems ⋮ Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties ⋮ Determination of fault-tolerant fabric-cutting schedules in a just-in-time apparel manufacturing environment ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research
Cites Work
- 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 alternative proof of optimality for the common due-date assignment problem
- Scheduling around a small common due date
- Scheduling to minimize weighted earliness and tardiness about a common due-date
- V-shape property for optimal schedules with monotone penalty functions
- 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
- 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
- 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
- Minimizing the Time-in-System Variance for a Finite Jobset
- Minimising Waiting Time Variance in the Single Machine Problem
- Deterministic and Random Single Machine Sequencing with Variance Minimization
- Note—A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
