A note on a proof of SPT optimality for single-machine sequencing problems via the transportation problem

DOI10.1016/0305-0548(90)90020-8zbMath0694.90063OpenAlexW2098821451MaRDI QIDQ909576

Cheng, T. C. Edwin

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0305-0548(90)90020-8

zbMATH Keywords

transportation problemshortest processing timeoptimal job sequencesingle-machine sequencing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

This page was built for publication: A note on a proof of SPT optimality for single-machine sequencing problems via the transportation problem