Scheduling two chains of unit jobs on one machine: A polyhedral study
From MaRDI portal
Publication:3100690
DOI10.1002/net.20452zbMath1233.90147MaRDI QIDQ3100690
Martine Labbé, Mara Servilio, Claudio Arbib
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
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
90C27: Combinatorial optimization
Related Items
A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem, Optimum Solution of the Closest String Problem via Rank Distance
Cites Work
- On facets of stable set polytopes of claw-free graphs with stability number 3
- Strong formulations for mixed integer programming: A survey
- On maximal independent sets of vertices in claw-free graphs
- Order preserving assignments without contiguity
- The relation of time indexed formulations of single machine scheduling problems to the node packing problem
- A polyhedral approach to single-machine scheduling problems.
- Scheduling jobs of equal length: Complexity, facets and computational results
- Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
- Solving Project Scheduling Problems by Minimum Cut Computations
- A competitive scheduling problem and its relevance to UMTS channel assignment
- Polyhedral Characterization of Discrete Dynamic Programming
- Single-Machine Scheduling Polyhedra with Precedence Constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
- A set packing model for the ground holding problem in congested networks
- On project scheduling with irregular starting time costs
