SEMI-ON-LINE PARALLEL MACHINES SCHEDULING UNDER KNOWN TOTAL AND LARGEST PROCESSING TIMES

DOI10.15807/jorsj.48.1zbMath1096.90014OpenAlexW2154765821MaRDI QIDQ5464325

Hark-Chin Hwang, Sooyoung Chang, Jong Ho Park

Publication date: 17 August 2005

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.48.1

zbMATH Keywords

schedulingapproximation algorithmcompetitive analysis

Mathematics Subject Classification ID

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

Related Items (2)

Semi-online scheduling: a survey ⋮ Semi-online scheduling problems on a small number of machines

This page was built for publication: SEMI-ON-LINE PARALLEL MACHINES SCHEDULING UNDER KNOWN TOTAL AND LARGEST PROCESSING TIMES