Single machine scheduling with symmetric earliness and tardiness penalties

DOI10.1016/S0377-2217(02)00163-7MaRDI QIDQ1869413zbMATH OpenFDO

Authors Jose A. Ventura, Sanjay Radhakrishnan

Publication date 10 April 2003

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

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)

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

Cites work

• scientific article; zbMATH DE number 3754389 (Why is no real title available?)
• scientific article; zbMATH DE number 53116 (Why is no real title available?)
• scientific article; zbMATH DE number 151905 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• 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
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• 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
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Optimal common due-date with limited completion time deviation
• Scheduling about a common due date with earliness and tardiness penalties
• Sequencing with Earliness and Tardiness Penalties: A Review
• Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule
• Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The Single Machine Early/Tardy Problem
• V-shape property of optimal sequence of jobs about a common due date on a single machine
• Validation of subgradient optimization

Cited in

(20)

• Punctuality and idleness in just-in-time scheduling
• Single machine scheduling with family setups to minimize total earliness and tardiness
• Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
• Minimization of total absolute deviation for a common due date
• Earliness-tardiness scheduling with setup considerations
• Solving scheduling problems with earliness and tardiness penalties using priority rules and linear programming
• Single machine earliness/tardiness scheduling problem with additional penalties about due window
• Preemption in single machine earliness/tardiness scheduling
• scientific article; zbMATH DE number 151905 (Why is no real title available?)
• A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
• Single machine scheduling with flow time and earliness penalties
• Solving a stochastic single machine problem with initial idle time and quadratic objective
• Minmax scheduling with job-classes and earliness-tardiness costs
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
• Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
• A survey on scheduling problems with due windows
• A branch and bound approach for single machine scheduling with earliness and tardiness penalties
• Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
• Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness
• scientific article; zbMATH DE number 2232351 (Why is no real title available?)

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)