On bilevel machine scheduling problems
From MaRDI portal
Publication:421065
DOI10.1007/S00291-010-0219-YzbMATH Open1238.90067OpenAlexW2141594462MaRDI QIDQ421065FDOQ421065
Authors: Tamás Kis, András Kovács
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
Recommendations
- scientific article; zbMATH DE number 2112614
- Bilevel programming applied to the flow shop scheduling problem
- The computational complexity of bilevel assignment problems
- Constraint programming approach to a bilevel scheduling problem
- A note on the complexity of the bilevel bottleneck assignment problem
Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Foundations of bilevel programming
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Algorithms for Scheduling Independent Tasks
- Scheduling Problems with Two Competing Agents
- The Stackelberg minimum spanning tree game
- Scheduling algorithms
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Algorithmic mechanism design
- Bilevel programming applied to the flow shop scheduling problem
- Multicriteria scheduling
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Bilevel programming with knapsack constraints
- Production planning problem with sequence dependent setups as a bilevel programming problem
- An Integrated Model for Job-Shop Planning and Scheduling
- Title not available (Why is that?)
Cited In (6)
- Single machine adversarial bilevel scheduling problems
- Title not available (Why is that?)
- The bilevel optimisation of a multi-agent project scheduling and staffing problem
- Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds
- Production planning problem with sequence dependent setups as a bilevel programming problem
- Bilevel programming applied to the flow shop scheduling problem
This page was built for publication: On bilevel machine scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q421065)