A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors
From MaRDI portal
Publication:3325433
DOI10.1287/moor.9.2.260zbMath0538.90036OpenAlexW2170926091MaRDI QIDQ3325433
Greg N. Frederickson, George S. Lueker, Edward G. jun. Coffman
Publication date: 1984
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.9.2.260
lower boundindependent tasksexpected makespanlargest- task-first, nonpreemptive approximation rulestwo identical processors
Related Items
New trends in machine scheduling, Performance ratios of the Karmarkar-Karp differencing method, Computer-assisted proof of performance ratios for the differencing method, A state-of-the-art review of parallel-machine scheduling research, An algorithm for flow time minimization and its asymptotic makespan properties, Performance of the LPT algorithm in multiprocessor scheduling, Unnamed Item