scientific article; zbMATH DE number 996547

MaRDI QIDQ3127069zbMATH OpenFDO

Authors Reinhard Stocker

Publication date 3 April 1997

zbMATH Keywords

branch-and-boundgraph-theoretic methodslower boundspolynomial algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 3991266
• Parallel branch-and-bound methods for the job-shop scheduling problem
• An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
• Simple approaches to parallel branch and bound
• Parallel branch and bound algorithms for the two-machine flow shop problem with limited machine availability

Cited in

(3)

• Loading and Sequencing on Parallel Machines
• scientific article; zbMATH DE number 3991266 (Why is no real title available?)
• scientific article; zbMATH DE number 146431 (Why is no real title available?)

This page was built for publication:

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