A polyhedral approach to single-machine scheduling problems.
From MaRDI portal
Recommendations
- A time indexed formulation of non-preemptive single machine scheduling problems
- Valid inequalities for a time-indexed formulation
- The relation of time indexed formulations of single machine scheduling problems to the node packing problem
- scientific article; zbMATH DE number 4170623
- A family of inequalities valid for the robust single machine scheduling polyhedron
Cited in
(42)- Time-indexed formulations for scheduling chains on a single machine: an application to airborne radars
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
- A time indexed formulation of non-preemptive single machine scheduling problems
- Polynomial algorithms for single machine scheduling problems with financial constraints
- The relation of time indexed formulations of single machine scheduling problems to the node packing problem
- The flow shop scheduling polyhedron with setup times
- Hybrid optimization methods for time-dependent sequencing problems
- Changeover formulations for discrete-time mixed-integer programming scheduling models
- Valid inequalities for a time-indexed formulation
- Structure of a simple scheduling polyhedron
- Scheduling jobs of equal length: Complexity, facets and computational results
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
- An exact algorithm for single-machine scheduling without machine idle time
- A family of inequalities valid for the robust single machine scheduling polyhedron
- Polyhedral results for position-based scheduling of chains on a single machine
- Scheduling of tasks with effectiveness precedence constraints
- Fast separation for the three-index assignment problem
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
- Just-in-time single-batch-processing machine scheduling
- A bucket indexed formulation for nonpreemptive single machine scheduling problems
- An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
- Scheduling two chains of unit jobs on one machine: a polyhedral study
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
- Decomposition algorithm for the single machine scheduling polytope
- A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility
- scientific article; zbMATH DE number 4181112 (Why is no real title available?)
- Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope
- scientific article; zbMATH DE number 4170623 (Why is no real title available?)
- On the facial structure of scheduling polyhedra
- scientific article; zbMATH DE number 176470 (Why is no real title available?)
- A branch and price solution approach for order acceptance and capacity planning in make-to-order operations
- scientific article; zbMATH DE number 702559 (Why is no real title available?)
- A supermodular relaxation for scheduling with release dates
- An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
- A time-dependent multiple criteria single-machine scheduling problem
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Propagation and branching strategies for job shop scheduling minimizing the weighted energy consumption
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
This page was built for publication: A polyhedral approach to single-machine scheduling problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1586211)
