Scheduling two chains of unit jobs on one machine: a polyhedral study
DOI10.1002/NET.20452zbMATH Open1233.90147OpenAlexW2021697981MaRDI QIDQ3100690FDOQ3100690
Authors: Claudio Arbib, Martine Labbé, Mara Servilio 
Publication date: 21 November 2011
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/74877/1/ArbibLabbeServilio.pdf
Recommendations
- Polyhedral results for position-based scheduling of chains on a single machine
- Single-Machine Scheduling Polyhedra with Precedence Constraints
- scientific article
- Structure of a simple scheduling polyhedron
- A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A set packing model for the ground holding problem in congested networks
- On maximal independent sets of vertices in claw-free graphs
- On project scheduling with irregular starting time costs
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Solving project scheduling problems by minimum cut computations
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
- A polyhedral approach to single-machine scheduling problems.
- A competitive scheduling problem and its relevance to UMTS channel assignment
- Single-Machine Scheduling Polyhedra with Precedence Constraints
- Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
- Polyhedral Characterization of Discrete Dynamic Programming
- On facets of stable set polytopes of claw-free graphs with stability number 3
- Scheduling jobs of equal length: Complexity, facets and computational results
- The relation of time indexed formulations of single machine scheduling problems to the node packing problem
- Strong formulations for mixed integer programming: A survey
- Order preserving assignments without contiguity
Cited In (6)
- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
- Optimum Solution of the Closest String Problem via Rank Distance
- The affine hull of the schedule polytope for servicing identical requests by parallel devices
- Polyhedral results for position-based scheduling of chains on a single machine
- Scheduling three chains on two parallel machines
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
This page was built for publication: Scheduling two chains of unit jobs on one machine: a polyhedral study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100690)
