Constraint programming approach to a bilevel scheduling problem
From MaRDI portal
Publication:647473
DOI10.1007/s10601-010-9102-3zbMath1233.90162MaRDI QIDQ647473
Publication date: 23 November 2011
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-010-9102-3
90C90: Applications of mathematical programming
91A80: Applications of game theory
90B35: Deterministic scheduling theory in operations research
Related Items
Bi-level multiple mode resource-constrained project scheduling problems under hybrid uncertainty, Joint optimization of product family configuration and scaling design by Stackelberg game
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- Minimizing the weighted number of tardy jobs on a single machine with release dates
- Non-binary quantified CSP: Algorithms and modelling
- Logic-based Benders decomposition
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Bundle trust-region algorithm for bilinear bilevel programming
- Foundations of bilevel programming
- Bilevel programming applied to the flow shop scheduling problem
- Dominance-based heuristics for one-machine total cost scheduling problems
- Solving quantified constraint satisfaction problems
- Production planning problem with sequence dependent setups as a bilevel programming problem
- A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
- BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs
- Bilevel programming with discrete lower level problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- Stackelberg-Nash-Cournot Equilibria: Characterizations and Computations
