scientific article; zbMATH DE number 640393

DOI10.1002/1520-6750(199408)41:5%3C677::AID-NAV3220410509%3E3.0.CO;2-7MaRDI QIDQ4306273zbMATH OpenFDO

Authors Ali Allahverdi, John Mittenthal

Publication date 19 September 1994

Full work available at URL https://doi.org/10.1002/1520-6750(199408)41:5%3C677::AID-NAV3220410509%3E3.0.CO;2-7

zbMATH Keywords

parallel machinesrandom breakdowns

Mathematics Subject Classification ID

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

Recommendations

• Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs
• Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
• A note on scheduling parallel machines subject to breakdown and repair
• Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties
• STOCHASTIC SCHEDULING WITH PREEMPTIVE-REPEAT MACHINE BREAKDOWNS TO MINIMIZE THE EXPECTED WEIGHTED FLOW TIME

Cites work

• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• scientific article; zbMATH DE number 3659268 (Why is no real title available?)

Cited in

(16)

• Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function
• On stochastic machine scheduling with general distributional assumptions
• General stochastic single-machine scheduling with regular cost functions
• An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns
• Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions
• Stochastically minimizing total flowtime in flowshops with no waiting space
• Stochastic scheduling on parallel machines to minimize discounted holding costs
• Stochastic single machine scheduling subject to machines breakdowns with quadratic early-tardy penalties for the preemptive-repeat model
• A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures
• Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
• Evaluation of the expected makespan of a set of non-resumable jobs on parallel machines with stochastic failures
• Stochastic scheduling on parallel machines subject to random breakdowns to minimize expected costs for earliness and tardy jobs
• Product grouping for batch processes
• A note on scheduling parallel machines subject to breakdown and repair
• A hybrid flowshop scheduling model considering dedicated machines and lot-splitting for the solar cell industry
• Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties

This page was built for publication:

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