scientific article; zbMATH DE number 996547

zbMATH Open0864.90064MaRDI QIDQ3127069FDOQ3127069

Authors: Reinhard Stocker 

Publication date: 3 April 1997

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

lower boundspolynomial algorithmbranch-and-boundgraph-theoretic methods

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Loading and Sequencing on Parallel Machines

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)