A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system

Keyphrases

• Processing Time 100%
• Bi-criteria 100%
• Pseudo-polynomial Time Algorithm 100%
• Just-in-time Job 100%
• Total Resources 100%
• Resource Consumption Cost 100%
• Scheduling System 100%
• Two-machine Flow Shop Scheduling 100%
• Two Dimensional 50%
• Approximation Scheme 50%
• NP-hard 50%
• Resource Allocation 50%
• Polynomial Approximation 50%
• Problem Analysis 50%
• Flow Shop Scheduling Problem 50%
• Job Processing 50%
• Discrete Quantity 50%
• Approximate Pareto Solutions 50%

Computer Science

• polynomial-time algorithm 100%
• Processing Time 100%
• Flowshop Scheduling 100%
• Just-in-Time 100%
• Resource Consumption Cost 100%
• approximation scheme 50%
• Scheduling Problem 50%
• Polynomial Approximation 50%
• Pareto Solution 50%

Mathematics

• Polynomial Time 100%
• Minimizes 100%
• Bicriteria 100%
• Approximates 50%
• Solution Exists 50%
• Fully Polynomial Approximation Scheme 50%