Pages that link to "Item:Q4074651"

The following pages link to A note on a scheduling problem with dual criteria (Q4074651):

Displaying 19 items.

• Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines (Q391787) (← links)
• Tradeoff between setup times and carrying costs for finished items (Q690011) (← links)
• Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness (Q856204) (← links)
• Reducibility among single machine weighted completion time scheduling problems (Q922287) (← links)
• Single machine scheduling to minimize weighted earliness subject to no tardy jobs (Q1105480) (← links)
• Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty (Q1121167) (← links)
• Multiple and bicriteria scheduling: A literature survey (Q1130028) (← links)
• Solving a bicriterion scheduling problem (Q1131944) (← links)
• An algorithm for single machine sequencing with deadlines to minimize total weighted completion time (Q1170111) (← links)
• Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming (Q1185994) (← links)
• Complexity of single machine, multi-criteria scheduling problems (Q1309989) (← links)
• An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. (Q1412717) (← links)
• Scheduling unit processing time jobs on a single machine with multiple criteria (Q1823849) (← links)
• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time (Q1924612) (← links)
• Multicriteria scheduling (Q2566699) (← links)
• Complexity of two dual criteria scheduling problems (Q2643797) (← links)
• Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine (Q2686863) (← links)
• Multicriteria scheduling problems: a survey (Q2773166) (← links)
• A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness (Q4297161) (← links)