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

DOI10.1057/JORS.1991.31MaRDI QIDQ3360653zbMATH OpenOpenAlexFDO

Authors T. C. Edwin Cheng

Publication date 1991

Published in The 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)

Recommendations

• Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
• A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure
• Note: Bicriteria scheduling for minimizing flow time and maximum tardiness
• Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
• scientific article; zbMATH DE number 721865

Cited in

(1)

• 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

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