Pages that link to "Item:Q1924612"

The following pages link to Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time (Q1924612):

Displayed 18 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)
• Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost (Q457296) ‎ (← links)
• A note on unbounded parallel-batch scheduling (Q495685) ‎ (← links)
• Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments (Q708343) ‎ (← links)
• A DP algorithm for minimizing makespan and total completion time on a series-batching machine (Q987835) ‎ (← links)
• Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan (Q995579) ‎ (← links)
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time (Q1375117) ‎ (← links)
• Common due date assignment and scheduling with ready times (Q1867095) ‎ (← links)
• Single-machine multi-agent scheduling problems with a global objective function (Q2434286) ‎ (← links)
• Pareto optima for total weighted completion time and maximum lateness on a single machine (Q2457015) ‎ (← links)
• Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness (Q2514124) ‎ (← links)
• Multicriteria scheduling (Q2566699) ‎ (← links)
• Multicriteria scheduling problems: a survey (Q2773166) ‎ (← links)
• BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN (Q2931723) ‎ (← links)
• (Q4934193) ‎ (← links)
• Counting and enumeration complexity with application to multicriteria scheduling (Q5920490) ‎ (← links)
• Scheduling with target start times (Q5925938) ‎ (← links)
• A time-dependent multiple criteria single-machine scheduling problem (Q5954823) ‎ (← links)