Minmax scheduling with job-classes and earliness-tardiness costs

DOI10.1016/j.ejor.2005.12.012zbMath1107.90022OpenAlexW1987706776MaRDI QIDQ856255

Daniel Oron, Gur Mosheiov

Publication date: 7 December 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.12.012

zbMATH Keywords

schedulingparallel machinesminmaxearliness-tardiness cost

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Order acceptance and due-date quotation in low machine rates ⋮ The optimal dispatch of Traffic and Patrol Police Service Platforms ⋮ Scheduling job classes on uniform machines ⋮ A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance

Cites Work

• Unnamed Item
• A dynamic programming method for single machine scheduling
• A heuristic for single machine scheduling with early and tardy costs
• Single machine scheduling with symmetric earliness and tardiness penalties
• A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• The Asymptotic Optimality of the LPT Rule
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• The Single Machine Early/Tardy Problem
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule
• Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs