Single machine scheduling with symmetric earliness and tardiness penalties

DOI10.1016/S0377-2217(02)00163-7zbMATH Open1012.90006MaRDI QIDQ1869413FDOQ1869413

Authors: Jose A. Ventura, Sanjay Radhakrishnan 

Publication date: 10 April 2003

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

Recommendations

• Single-machine scheduling of unit-time jobs with earliness and tardiness penalties
• Single-machine scheduling with time windows and earliness/tardiness penalties
• OPTIMAL SINGLE-MACHINE SCHEDULING FOR MINIMIZING THE SUM OF EARLINESS AND TARDINESS PENALTIES
• On the Single-machine Scheduling Problem with Tardiness Penalties
• Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty
• Single machine scheduling with flow time and earliness penalties
• A note on ‘Single-machine scheduling for minimizing total cost with identical, asymmetrical earliness and tardiness penalties’
• Single machine earliness and tardiness scheduling
• Single machine scheduling to minimize weighted earliness subject to maximum tardiness
• A branch and bound approach for single machine scheduling with earliness and tardiness penalties

zbMATH Keywords

heuristicscomputational analysissingle machine schedulingLagrangian relaxation

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Title not available (Why is that?)
• Validation of subgradient optimization
• A dynamic programming method for single machine scheduling
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Sequencing with Earliness and Tardiness Penalties: A Review
• Title not available (Why is that?)
• The Single Machine Early/Tardy Problem
• Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule
• Title not available (Why is that?)
• Optimal common due-date with limited completion time deviation
• Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
• Title not available (Why is that?)
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
• Determination of an optimal common due date and optimal sequence in a single machine job shop
• Scheduling about a common due date with earliness and tardiness penalties
• V-shape property of optimal sequence of jobs about a common due date on a single machine

Cited In (19)

• Single machine scheduling with family setups to minimize total earliness and tardiness
• Single machine scheduling with flow time and earliness penalties
• Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
• A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
• Single machine earliness/tardiness scheduling problem with additional penalties about due window
• Minmax scheduling with job-classes and earliness-tardiness costs
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
• Punctuality and idleness in just-in-time scheduling
• Preemption in single machine earliness/tardiness scheduling
• Solving a stochastic single machine problem with initial idle time and quadratic objective
• Minimization of total absolute deviation for a common due date
• A survey on scheduling problems with due windows
• 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
• Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
• Earliness-tardiness scheduling with setup considerations
• Title not available (Why is that?)
• A branch and bound approach for single machine scheduling with earliness and tardiness penalties
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869413)