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

DOI10.1057/jors.1991.31zbMath0733.90034OpenAlexW2119754524MaRDI QIDQ3360653

Cheng, T. C. Edwin

Publication date: 1991

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.83

zbMATH Keywords

single machinepolynomial-time algorithmbicriteria objective functionknown processing times and due dates

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

Multiple and bicriteria scheduling: A literature survey

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