Optimal timing of a sequence of tasks with general completion costs

DOI10.1016/j.ejor.2004.01.025zbMath1112.90340OpenAlexW2066796113MaRDI QIDQ1776957

Francis Sourd

Publication date: 12 May 2005

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

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

zbMATH Keywords

schedulingdynamic programmingpiecewise linear cost functionsearliness-tardiness costsidle time penalties

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem, Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines, An improved earliness--tardiness timing algorithm, Minimizing total earliness and tardiness on a single machine using a hybrid heuristic, An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem, A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time, Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence, Recent progress of local search in handling the time window constraints of the vehicle routing problem, Multicriteria models for just-in-time scheduling, Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence, Recent progress of local search in handling the time window constraints of the vehicle routing problem, Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints, Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates, Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem, Continuous filling and emptying of storage systems in constraint-based scheduling, Scheduling with periodic availability constraints and irregular cost functions, The one-machine just-in-time scheduling problem with preemption, Multicriteria scheduling, Punctuality and idleness in just-in-time scheduling

Uses Software

• ILOG SCHEDULE

Cites Work

• Unnamed Item
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
• PERT scheduling with convex cost functions.
• The one-machine problem with earliness and tardiness penalties
• Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• Single-machine scheduling with early and tardy completion costs
• Optimal timing schedules in earliness-tardiness single machine sequencing
• On project scheduling with irregular starting time costs