Two schemes of the branch-and-bound method for a flow shop total weighted tardiness minimization problem

DOI10.1134/S199508021304001XzbMath1284.90020MaRDI QIDQ2442499

V. R. Fazylov, I. K. Agapeevich

Publication date: 3 April 2014

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

flow shop systemsbranch-and-bound methodtotal weighted tardiness minimization

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• A multi-objective particle swarm for a flow shop scheduling problem
• Complexity results for scheduling chains on a single machine
• Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs

This page was built for publication: Two schemes of the branch-and-bound method for a flow shop total weighted tardiness minimization problem