Minmax earliness-tardiness costs with unit processing time jobs
From MaRDI portal
Publication:5937720
DOI10.1016/S0377-2217(99)00432-4zbMath0983.90022WikidataQ127792626 ScholiaQ127792626MaRDI QIDQ5937720
Publication date: 12 July 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time ⋮ Scheduling problems with two competing agents to minimized weighted earliness-tardiness ⋮ Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system ⋮ The just-in-time scheduling problem in a flow-shop scheduling system ⋮ The optimal dispatch of Traffic and Patrol Police Service Platforms ⋮ Scheduling job classes on uniform machines ⋮ Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration ⋮ Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey ⋮ Scheduling with a common due-window: polynomially solvable cases ⋮ Optimal release times in single-stage manufacturing systems with blocking: optimal control perspective ⋮ Due-window assignment with identical jobs on parallel uniform machines
Cites Work
- Unnamed Item
- Unnamed Item
- Equivalence of mean flow time problems and mean absolute deviation problems
- A note on one-processor scheduling with asymmetric earliness and tardiness penalties
- Approximation Algorithms for the Assembly Line Crew Scheduling Problem
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single- and multiple-processor models for minimizing completion time variance
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- 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
- Due-date assignment and early/tardy scheduling on identical parallel machines
- The parallel machine min-max weighted absolute lateness scheduling problem
- Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
- Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
- Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs