Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem

Keyphrases

• Makespan 100%
• Flow Shop Scheduling Problem 100%
• Assembly Type 100%
• Machine Assembly 100%
• NP-complete 50%
• Solution Algorithm 50%
• Approximate Solution 50%
• Problem Formulation 50%
• Error Bound 50%
• Branch-and-bound 50%
• Polynomially Solvable Cases 50%
• Solution Scheme 50%
• Bound Solution 50%

Computer Science

• Scheduling Problem 100%
• Flowshop Scheduling 100%
• Approximate Solution 50%
• Branch-and-Bound Algorithm Design 50%
• Problem Formulation 50%

Mathematics

• Approximate Solution 100%
• Error Bound 100%