Minimization of the Makespan with a Discrete-Time State-Task Network Formulation

Keyphrases

• Discrete States 100%
• Makespan 100%
• State-task Network 100%
• Computationally Efficient 33%
• Tight 33%
• Maximization Problem 33%
• Novel Algorithm 33%
• LP Relaxation 33%
• Process Networks 33%
• Feasible Solution 33%
• Feasibility Problem 33%
• Feasible Schedule 33%
• Production Maximization 33%
• Integer Cuts 33%
• Multipurpose Batch Plants 33%

Engineering

• Tasks 100%
• Discrete Time 100%
• Feasible Solution 33%
• Batch Plant 33%

Computer Science

• Feasible Schedule 100%