Valid inequalities for the time-indexed non-preemptive single machine scheduling problem

DOI10.1016/J.DISOPT.2025.100926MaRDI QIDQ7310967zbMATH OpenFDO

Authors Ankit Bansal

Publication date 6 August 2026

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISOPT.2025.100926

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cites work

• A polyhedral approach to single-machine scheduling problems.
• A time indexed formulation of non-preemptive single machine scheduling problems
• An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems
• Classification and comparison of integer programming formulations for the single-machine sequencing problem
• scientific article; zbMATH DE number 702559 (Why is no real title available?)
• Near-optimal solutions of large-scale single-machine scheduling problems
• Scheduling jobs of equal length: Complexity, facets and computational results
• The single-processor scheduling problem with time restrictions: complexity and related problems
• Time-indexed formulations and the total weighted tardiness problem
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation

This page was built for publication: Valid inequalities for the time-indexed non-preemptive single machine scheduling problem

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