Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties
From MaRDI portal
Publication:1278719
DOI10.1016/0377-2217(95)00253-7zbMath0922.90084OpenAlexW1982656504MaRDI QIDQ1278719
Publication date: 18 October 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00253-7
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
Machine scheduling with earliness, tardiness and non-execution penalties ⋮ A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios ⋮ Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A V-shape property of optimal schedule of jobs about a common due date
- Survey of scheduling research involving due date determination decisions
- Mimimization of agreeably weighted variance in single machine systems
- Scheduling around a small common due date
- V-shape property for optimal schedules with monotone penalty functions
- On the general solution for a class of early/tardy problems
- Completion time variance minimization on a single machine is difficult
- Scheduling with monotonous earliness and tardiness penalties
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Stochastic Scheduling with Release Dates and Due Dates
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- 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
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- Minimising Waiting Time Variance in the Single Machine Problem
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
