Heuristics for short route job shop scheduling problems

DOI10.1007/s001860050033zbMath0929.90035OpenAlexW2047946870MaRDI QIDQ1298692

Inna G. Drobouchevitch, Vitaly A. Strusevich

Publication date: 18 January 2000

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860050033

zbMATH Keywords

approximation algorithmmakespanheuristicworst-case ratioNP-hard job shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Heuristics for the two-stage job shop scheduling problem with a bottleneck machine

This page was built for publication: Heuristics for short route job shop scheduling problems