A branch-and-bound procedure for the robust cyclic job shop problem

DOI10.1007/978-3-319-96151-4_20zbMATH Open1404.90114OpenAlexW2884318641MaRDI QIDQ1661891FDOQ1661891

Authors: 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

Recommendations

• A branch and bound algorithm for the job-shop scheduling problem
• Robust optimization for the cyclic hoist scheduling problem
• A branch and bound method for the job-shop problem with sequence-dependent setup times
• A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows
• A robust basic cyclic scheduling problem
• A branch and bound algorithm for the flow-shop scheduling problem
• Two branch-and-bound algorithms for the robust parallel machine scheduling problem

zbMATH Keywords

branch-and-bound algorithmrobust optimizationCyclic Job Shop problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cited In (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

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