Processing time generation schemes for parallel machine scheduling problems with various correlation structures

DOI10.1007/S10951-013-0347-8MaRDI QIDQ490376zbMATH OpenOpenAlexFDO

Authors Yang-Kuei Lin, Michele E. Pfund, John Fowler

Publication date 22 January 2015

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-013-0347-8

zbMATH Keywords

correlationschedulingparallel machinesprocessing time generation schemes

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Recommendations

• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Single machine scheduling when processing times are correlated normal random variables
• Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
• A dynamic heuristic for the stochastic unrelated parallel machine scheduling problem
• Parallel-machine scheduling with time dependent processing times

Cites work

• scientific article; zbMATH DE number 3425355 (Why is no real title available?)
• Experimental comparison of approximation algorithms for scheduling unrelated parallel machines
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Heuristics for scheduling unrelated parallel machines
• Scheduling. Theory, algorithms, and systems.

Cited in

(2)

• Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times
• Controlling and assessing correlations of cost matrices in heterogeneous scheduling

This page was built for publication: Processing time generation schemes for parallel machine scheduling problems with various correlation structures

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