SOME BOUNDS ON APPROXIMATION ALGORITHMS FOR n/m/I/L_<MAX> AND n/2/F/L_<MAX> SCHEDULING PROBLEMS

DOI10.15807/JORSJ.26.212MaRDI QIDQ3673461zbMATH OpenOpenAlexFDO

Authors Teruo Masuda, Toshio Nishida, Hiroaki Ishii

Publication date 1983

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.26.212

zbMATH Keywords

2xn flow shop schedulingapproximation algorithmsminimization of maximum latenessparallel machine schedulingworst case bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited in

(2)

• Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times
• Scheduling on uniform parallel machines to minimize maximum lateness

This page was built for publication: SOME BOUNDS ON APPROXIMATION ALGORITHMS FOR n/m/I/L_<MAX> AND n/2/F/L_<MAX> SCHEDULING PROBLEMS

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