Probabilistic Analysis of a Machine Scheduling Problem

DOI10.1287/MOOR.10.2.328MaRDI QIDQ3680595zbMATH OpenOpenAlexFDO

Authors Pedro G. Gazmuri

Publication date 1985

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.10.2.328

zbMATH Keywords

flow shopprobabilistic analysistotal flow timeone machineAsymptotically optimal algorithmsNo preemptions

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Probabilistic analysis of the minimum weighted flowtime scheduling problem
• A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length
• A Probabilistic Analysis of Two-Machine Flowshops
• scientific article; zbMATH DE number 947476
• Publication:3481475

Cited in

(12)

• Probabilistic single processor scheduling
• Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
• Probabilistic analysis of the minimum weighted flowtime scheduling problem
• scientific article; zbMATH DE number 947476 (Why is no real title available?)
• scientific article; zbMATH DE number 5521829 (Why is no real title available?)
• Randomized mechanism design for decentralized network scheduling
• Effective on-line algorithms for reliable due date quotation and large-scale scheduling
• New directions in scheduling theory
• A look-ahead heuristic for scheduling jobs with release dates on a single machine
• A Probabilistic Analysis of Two-Machine Flowshops
• Processor Reordering Rules
• An iterative heuristic for the single machine dynamic total completion time scheduling problem

This page was built for publication: Probabilistic Analysis of a Machine Scheduling Problem

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