Exponentially distributed jobshop scheduling problems.

DOI10.1080/15326348808807074MaRDI QIDQ3802871zbMATH OpenOpenAlexFDO

Authors Igal Adiri, Esther Frostig

Publication date 1988

Published in Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15326348808807074

zbMATH Keywords

stochastic schedulingtwo machineschain of operationslongest expected remaining processing time policy

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 4064442
• Scheduling Jobs with Exponentially Distributed Processing Times on Two Machines with Resource Constraints
• Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
• Stochastic scheduling for a two-machine open shop
• A note on the two machine job shop with exponential processing times

Cited in

(3)

• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
• Scheduling Jobs with Exponentially Distributed Processing Times on Two Machines with Resource Constraints
• A note on the two machine job shop with exponential processing times

This page was built for publication: Exponentially distributed jobshop scheduling problems.

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