scientific article

zbMath1274.90149MaRDI QIDQ2861503

Jacques Carlier, Aziz Moukrim, Mohamed Haouari, Mohamed Kharbeche

Publication date: 8 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001101

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

A dynamic scheduling algorithm for singe-arm two-cluster tools with flexible processing times ⋮ Optimizing blocking flow shop scheduling problem with total completion time criterion ⋮ A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots

Cites Work

• An optimization-based heuristic for the robotic cell problem
• Scheduling of parts and robot activities in a two machine robotic cell
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• Scheduling

This page was built for publication: