scientific article; zbMATH DE number 4156186

MaRDI QIDQ3484616zbMATH OpenFDO

Authors Heidemarie Bräsel, Frank Werner

Publication date 1990

zbMATH Keywords

branch and boundexact solutionjob shop problemLower boundslatin rectangleenumeration strategy

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• On the number of feasible schedules of the open-shop-problem-an application of special latin rectangles
• scientific article; zbMATH DE number 432988
• scientific article; zbMATH DE number 4099024
• An Algorithm for Solving the Job-Shop Problem
• scientific article; zbMATH DE number 4074799

Cited in

(4)

• On the number of feasible schedules of the open-shop-problem-an application of special latin rectangles
• Insertion techniques for the heuristic solution of the job shop problem
• The job shop scheduling problem: Conventional and new solution techniques
• scientific article; zbMATH DE number 432988 (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 Q3484616)