Single machine adversarial bilevel scheduling problems

DOI10.1016/J.EJOR.2023.11.018MaRDI QIDQ6554600zbMATH OpenFDO

Authors Vincent T'kindt, F. Della Croce, Alessandro Agnetis

Publication date 13 June 2024

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2023.11.018

zbMATH Keywords

bilevel optimizationcomplexity resultsschedulingsingle machine

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• A study on the computational complexity of the bilevel knapsack problem
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
• Bilevel programming applied to the flow shop scheduling problem
• Bilevel programming approach applied to the flow shop scheduling problem under fuzziness
• Bilevel programming problems. Theory, algorithms and applications to energy networks
• Constraint programming approach to a bilevel scheduling problem
• Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Multiagent scheduling. Models and algorithms
• Necessary and sufficient conditions of optimality for some classical scheduling problems
• On bilevel machine scheduling problems
• The polynomial-time hierarchy
• The trouble with the second quantifier

Cited in

(3)

• Bilevel adversarial scheduling problem on parallel machines
• Fifty years of research in scheduling -- theory and applications
• The fourth comprehensive review of scheduling problems with setup times

This page was built for publication: Single machine adversarial bilevel scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6554600)