One machine scheduling to minimize expected mean tardiness. I

DOI10.1016/0305-0548(91)90015-JzbMath0744.90039MaRDI QIDQ1184467

B. V. Cadambi

Publication date: 28 June 1992

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundsingle machinemeansimultaneously available jobsexponentially distributed processing timestotal expected tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

One machine scheduling to minimize expected mean tardiness. II ⋮ Optimal sequences in stochastic single machine shops

Cites Work

• One machine scheduling to minimize expected mean tardiness. II
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• A hybrid algorithm for the one machine sequencing problem to minimize total tardiness

This page was built for publication: One machine scheduling to minimize expected mean tardiness. I