A permutation flow-shop scheduling problem with convex models of operation processing times

Keyphrases

• Processing Time 100%
• Convex Model 100%
• Operation Model 100%
• Permutation Flow Shop Scheduling Problem 100%
• Decreasing Function 33%
• Makespan 33%
• Processing Order 33%
• NP-hard 33%
• Solution Scheme 33%
• Branch-and-bound 33%
• Computational Experiment 33%
• Precedence Constraints 33%
• Problem Analysis 33%
• Constrained Resources 33%
• Approximation Algorithms 33%
• Computational Complexity Analysis 33%
• Energy Raw Materials 33%
• Extended Permutation 33%
• Outlays 33%
• Bound Solution 33%

Computer Science

• Scheduling Problem 100%
• Flowshop Scheduling 100%
• Processing Time 100%
• Order Processing 50%
• Branch-and-Bound Algorithm Design 50%
• Computational Experiment 50%
• Precedence Constraint 50%
• Complexity Analysis 50%
• Approximate Algorithm 50%
• Computational Complexity 50%

Mathematics

• Permutation 100%
• Decreasing Function 33%
• Approximates 33%
• Minimizes 33%