On bilevel machine scheduling problems
From MaRDI portal
Publication:421065
DOI10.1007/s00291-010-0219-yzbMath1238.90067MaRDI QIDQ421065
Publication date: 23 May 2012
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-010-0219-y
90C05: Linear programming
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds, The bilevel optimisation of a multi-agent project scheduling and staffing problem
Cites Work
- Unnamed Item
- Unnamed Item
- The Stackelberg minimum spanning tree game
- Foundations of bilevel programming
- Bilevel programming applied to the flow shop scheduling problem
- Production planning problem with sequence dependent setups as a bilevel programming problem
- Multicriteria scheduling
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Scheduling Problems with Two Competing Agents
- An Integrated Model for Job-Shop Planning and Scheduling
- Algorithms for Scheduling Independent Tasks
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Algorithmic mechanism design
- Bilevel programming with knapsack constraints