A Bayesian Sequential Single Machine Scheduling Problem to Minimize the Expected Weighted Sum of Flowtimes of Jobs with Exponential Processing Times

DOI10.1287/OPRE.41.5.924MaRDI QIDQ4286471zbMATHOpenAlexFDO

Authors Toshio Hamada, Kevin D. Glazebrook

Publication date 6 April 1994

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.41.5.924

zbMATH Keywords

single machineoptimal strategiesdynamic programBayesian sequential single machine schedulingweighted sum of flowtimes

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Stochastic systems in control theory (general) (93E03)

Recommendations

• scientific article; zbMATH DE number 1766736
• Single-machine scheduling with exponential processing times and general stochastic cost functions
• Scheduling jobs with exponential processing times on parallel machines
• Job scheduling to minimize expected weighted flowtime on uniform processors
• One machine scheduling to minimize expected mean tardiness. I

Cited in

(8)

• A Bayesian approach to the triage problem with imperfect classification
• Learning in stochastic machine scheduling
• One machine scheduling to minimize expected mean tardiness. I
• A BAYESIAN SEQUENTIAL BATCH-SIZE DECISION PROBLEM TO MINIMIZE EXPECTED TOTAL COMPLETION TIME ON A SINGLE MACHINE
• Exact and approximate algorithms for high-multiplicity parallel machine scheduling
• scientific article; zbMATH DE number 1766736 (Why is no real title available?)
• Job sequencing with exponential functions of processing times
• A BAYESIAN SEQUENTIAL SINGLE MACHINE BATCHING AND SCHEDULING PROBLEM WITH RANDOM SETUP TIME

This page was built for publication: A Bayesian Sequential Single Machine Scheduling Problem to Minimize the Expected Weighted Sum of Flowtimes of Jobs with Exponential Processing Times

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