SOME BOUNDS ON APPROXIMATION ALGORITHMS FOR n/m/I/L_<MAX> AND n/2/F/L_<MAX> SCHEDULING PROBLEMS
From MaRDI portal
Publication:3673461
DOI10.15807/jorsj.26.212zbMath0522.90046OpenAlexW2181754104MaRDI QIDQ3673461
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
parallel machine schedulingapproximation algorithmsworst case boundsminimization of maximum lateness2xn flow shop scheduling
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
Scheduling on uniform parallel machines to minimize maximum lateness ⋮ Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times