A branch-and-bound algorithm for one class of scheduling problem

MaRDI QIDQ1311598zbMATH OpenFDO

Authors V. G. Anisimov, E. G. Anisimov

Publication date 3 March 1994

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundoptimal distribution of discrete heterogeneous resources on a network

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35)

Cited in

(6)

• Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
• A branch-and-cut algorithm for a resource-constrained scheduling problem
• A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM
• Reservation table scheduling: branch-and-bound based optimizationvs. integer linear programming techniques
• A branch-and-bound algorithm for the coupled task problem
• A branch and bound algorithm for the minimum storage-time sequencing problem

This page was built for publication: A branch-and-bound algorithm for one class of scheduling problem

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