Minimizing Makespan in No-Wait Job Shops

DOI10.1287/moor.1050.0155zbMath1278.90141OpenAlexW2050076286MaRDI QIDQ5387950

Nikhil Bansal, M. I. Sviridenko, Mohammad Mahdian

Publication date: 27 May 2008

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

Full work available at URL: https://semanticscholar.org/paper/80e8a195c08f2708f2c130f202eaa23b98df9c83

zbMATH Keywords

approximation algorithmsno-wait job shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

A complete 4-parametric complexity classification of short shop scheduling problems ⋮ A survey of scheduling problems with no-wait in process ⋮ An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops ⋮ Complete Complexity Classification of Short Shop Scheduling ⋮ Complete local search with limited memory algorithm for no-wait job shops to minimize makespan ⋮ SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS

This page was built for publication: Minimizing Makespan in No-Wait Job Shops