Note—A Note on Single Machine Sequencing with Random Processing Times

DOI10.1287/mnsc.23.10.1144zbMath0367.90075OpenAlexW2126203796MaRDI QIDQ4145411

Thom J. Hodgson

Publication date: 1977

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.23.10.1144

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Chance-constrained model for uncertain job shop scheduling problem ⋮ Single machine scheduling to minimize the number of late jobs under uncertainty. ⋮ Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling

This page was built for publication: Note—A Note on Single Machine Sequencing with Random Processing Times