Single machine scheduling with symmetric earliness and tardiness penalties

DOI10.1016/S0377-2217(02)00163-7zbMath1012.90006MaRDI QIDQ1869413

José A. Ventura, Sanjay Radhakrishnan

Publication date: 10 April 2003

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

zbMATH Keywords

heuristicsLagrangian relaxationsingle machine schedulingcomputational analysis

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (11)

Preemption in single machine earliness/tardiness scheduling ⋮ A survey on scheduling problems with due windows ⋮ Minmax scheduling with job-classes and earliness-tardiness costs ⋮ Solving a stochastic single machine problem with initial idle time and quadratic objective ⋮ Minimizing total earliness and tardiness on a single machine using a hybrid heuristic ⋮ Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness ⋮ Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard ⋮ Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties ⋮ Earliness-tardiness scheduling with setup considerations ⋮ A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties ⋮ Punctuality and idleness in just-in-time scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling about a common due date with earliness and tardiness penalties
• Optimal common due-date with limited completion time deviation
• V-shape property of optimal sequence of jobs about a common due date on a single machine
• A dynamic programming method for single machine scheduling
• 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
• Sequencing with Earliness and Tardiness Penalties: A Review
• Determination of an optimal common due date and optimal sequence in a single machine job shop
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
• The Single Machine Early/Tardy Problem
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule
• Validation of subgradient optimization

This page was built for publication: Single machine scheduling with symmetric earliness and tardiness penalties