Minimizing Makespan in No-Wait Job Shops

DOI10.1287/MOOR.1050.0155MaRDI QIDQ5387950zbMATH OpenOpenAlexFDO

Authors N. Bansal, Mohammad Mahdian, Maxim Sviridenko

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)

Recommendations

• Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
• Inapproximability results for no-wait job shop scheduling.
• Makespan minimization in job shops: a polynomial time approximation scheme
• Two-machine flow shop scheduling problems with no-wait jobs
• Makespan Minimization in Job Shops: A Linear Time Approximation Scheme

Cited in

(10)

• Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
• A survey of scheduling problems with no-wait in process
• Optimal job insertion in the no-wait job shop
• A complete 4-parametric complexity classification of short shop scheduling problems
• An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops
• Makespan minimization in job shops: a polynomial time approximation scheme
• Complete Complexity Classification of Short Shop Scheduling
• SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS
• Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
• Inapproximability results for no-wait job shop scheduling.

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

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