Complexity and a branch and bound algorithm of 3TMF scheduling problem

MaRDI QIDQ3641252zbMATH OpenFDO

Authors Xuhua Lü, Qinnong Su, Rong Hu

Publication date 11 November 2009

zbMATH Keywords

3TMF scheduling problembranch and bound algorithmNP-complete problem

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Deterministic scheduling theory in operations research (90B35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A branch and bound algorithm for the job-shop scheduling problem
• Optimal scheduling of the 3-machine assembly-type flow shop
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• scientific article; zbMATH DE number 2114378
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem

This page was built for publication: Complexity and a branch and bound algorithm of 3TMF scheduling problem

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