Bilevel programming applied to the flow shop scheduling problem

DOI10.1016/0305-0548(95)00034-8zbMath0847.90080OpenAlexW2116698909MaRDI QIDQ1915962

Wei Wang, John K. Karlof

Publication date: 1 July 1996

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(95)00034-8

zbMATH Keywords

makespanbilevel programmingtotal flowtimeflow-shop schedulingtwo level branch and bound

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Bi-level multi-objective mathematical model for job-shop scheduling: the application of Theory of Constraints ⋮ Scheduling identical parallel machines and operators within a period based changing mode ⋮ Solving discretely-constrained Nash-Cournot games with an application to power markets ⋮ On bilevel machine scheduling problems ⋮ Constraint programming approach to a bilevel scheduling problem ⋮ A bilevel mixed-integer program for critical infrastructure protection planning ⋮ Integer solutions via goal programming to hierarchical systems. ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• A Branch and Bound Algorithm for the Bilevel Programming Problem
• A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem
• Scheduling the Open Shop to Minimize Mean Flow Time
• Minimizing Job Idleness in Deadline Constrained Environments
• Minimizing the Number of Machine Idle Intervals with Minimum Makespan in a Flow-Shop
• Two-Level Linear Programming

This page was built for publication: Bilevel programming applied to the flow shop scheduling problem