A branch-and-bound procedure for the robust cyclic job shop problem
From MaRDI portal
Publication:1661891
DOI10.1007/978-3-319-96151-4_20zbMath1404.90114OpenAlexW2884318641MaRDI QIDQ1661891
Idir Hamaz, Laurent Houssin, Sonia Cafieri
Publication date: 17 August 2018
Full work available at URL: https://hal-enac.archives-ouvertes.fr/hal-01856687/file/branch-bound-procedure.pdf
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items (2)
Constraint programming for the robust two-machine flow-shop scheduling problem with budgeted uncertainty ⋮ Computing the execution probability of jobs with replication in mixed-criticality schedules
This page was built for publication: A branch-and-bound procedure for the robust cyclic job shop problem
