A new model for the preemptive earliness-tardiness scheduling problem

DOI10.1016/J.COR.2008.08.018zbMATH Open1158.90354OpenAlexW2043693499MaRDI QIDQ1013402FDOQ1013402

Authors: Nina Runge, Francis Sourd 

Publication date: 17 April 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.08.018

Recommendations

• Dynamic model and optimal scheduling algorithm for a set of jobs with preemption constraints
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
• A hybrid approach to scheduling with earliness and tardiness costs
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• scientific article; zbMATH DE number 40475
• Preemption in single machine earliness/tardiness scheduling
• Solving scheduling problems with earliness and tardiness penalties using priority rules and linear programming
• New exact algorithms for one-machine earliness-tardiness scheduling
• Earliness and tardiness scheduling problems on a batch processor
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems

zbMATH Keywords

local searchlower boundpreemptionschedulingearliness-tardinesstiming algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
• Preemption in single machine earliness/tardiness scheduling
• Single-machine scheduling with early and tardy completion costs
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• The one-machine problem with earliness and tardiness penalties
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• Optimal timing schedules in earliness-tardiness single machine sequencing
• An improved earliness--tardiness timing algorithm
• The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
• Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
• Scheduling with target start times

Cited In (8)

• A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
• An improved earliness--tardiness timing algorithm
• A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
• Multimode preemptive resource investment problem subject to due dates for activities: formulation and solution procedure
• The one-machine just-in-time scheduling problem with preemption
• A multi-objective optimization for preemptive identical parallel machines scheduling problem
• JIT-transportation problem and its algorithm

This page was built for publication: A new model for the preemptive earliness-tardiness scheduling problem

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