Optimal Assignment of Total-work-content Due-dates and Sequencing in a Single-machine Shop

DOI10.1057/jors.1991.31zbMath0745.90036OpenAlexW2151936506MaRDI QIDQ5966559

Cheng, T. C. Edwin

Publication date: 25 June 1992

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1991.31

zbMATH Keywords

single machinesequencingdue-datesmaximum-tardiness penalty

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 (1)

Optimal assignment of due-dates for preemptive single-machine scheduling

This page was built for publication: Optimal Assignment of Total-work-content Due-dates and Sequencing in a Single-machine Shop