The one-machine just-in-time scheduling problem with preemption

DOI10.1016/j.disopt.2008.08.001zbMath1159.90020OpenAlexW2091592818MaRDI QIDQ1013290

Francis Sourd, Yann Hendel, Nina Runge

Publication date: 17 April 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2008.08.001

zbMATH Keywords

single-machine schedulingjust-in-timepreemption

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (7)

An exact algorithm for the preemptive single machine scheduling of equal-length jobs ⋮ An exact algorithm for the bi-objective timing problem ⋮ A multi-objective optimization for preemptive identical parallel machines scheduling problem ⋮ Graph multi-coloring for a job scheduling application ⋮ Modeling single machine preemptive scheduling problems for computational efficiency ⋮ A flexible job shop scheduling approach with operators for coal export terminals -- a mature approach ⋮ Batch sizing and just-in-time scheduling with common due date

Cites Work

• Unnamed Item
• Preemption in single machine earliness/tardiness scheduling
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• An improved earliness--tardiness timing algorithm
• Optimal timing of a sequence of tasks with general completion costs
• 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
• A recovering beam search algorithm for the single machine just-in-time scheduling problem
• Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Solving the Convex Cost Integer Dual Network Flow Problem
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
• Single-machine scheduling with early and tardy completion costs
• Optimal timing schedules in earliness-tardiness single machine sequencing
• Scheduling with target start times

This page was built for publication: The one-machine just-in-time scheduling problem with preemption