A Branch-and-Bound Method for Sequencing Problems with Linear and Exponential Penalty Functions

DOI10.1057/JORS.1977.31MaRDI QIDQ4119029zbMATH OpenOpenAlexFDO

Authors W. Townsend

Publication date 1977

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cited in

(2)

• A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
• Minimizing the weighted number of tardy jobs on a two-machine flow shop.

This page was built for publication: A Branch-and-Bound Method for Sequencing Problems with Linear and Exponential Penalty Functions

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