Scheduling independent tasks to minimize the makespan on identical machines

DOI10.1017/S026996480000396XzbMATH Open1335.90032MaRDI QIDQ2805367FDOQ2805367

Authors: Peter Downey, John Bruno, E. G. jun. Coffman 

Publication date: 11 May 2016

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4064442
• Stochastic limit laws for schedule makespans
• scientific article; zbMATH DE number 947476
• On the Expected Relative Performance of List Scheduling
• Inequalities and bounds for the scheduling of stochastic jobs on parallel machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Inequalities: theory of majorization and its applications
• On Pólya frequency functions. I. The totally positive functions and their Laplace transforms
• Bivariate characterization of some stochastic order relations
• A new ordering for stochastic majorization: theory and applications

Cited In (3)

• List scheduling algorithms to minimize the makespan on identical parallel machines
• On minimizing the makespan when some jobs cannot be assigned on the same machine
• Some results on the residual life at random time

This page was built for publication: Scheduling independent tasks to minimize the makespan on identical machines

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