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

DOI10.1057/jors.1977.31zbMath0348.90140OpenAlexW1965670667MaRDI QIDQ4119029

W. Townsend

Publication date: 1977

Published in: 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

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

Related Items (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