Time-indexed formulations for scheduling chains on a single machine: an application to airborne radars

DOI10.1016/J.EJOR.2009.07.037zbMath1177.90143OpenAlexW2011306843MaRDI QIDQ1046123

Ruslan Sadykov, Philippe Baptiste

Publication date: 21 December 2009

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

Full work available at URL: https://hal.inria.fr/inria-00339639v2/file/FirstSubmission.pdf

zbMATH Keywords

integer programmingschedulingOR in military

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items (1)

Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty

Cites Work

• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
• A time indexed formulation of non-preemptive single machine scheduling problems
• A polyhedral approach to single-machine scheduling problems.
• On a periodic maintenance problem
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
• On scheduling a multifunction radar
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Distance-constrained scheduling and its applications to real-time systems
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
• Single-machine scheduling with early and tardy completion costs

This page was built for publication: Time-indexed formulations for scheduling chains on a single machine: an application to airborne radars