Pages that link to "Item:Q888315"

The following pages link to Pareto minimizing total completion time and maximum cost with positional due indices (Q888315):

Displaying 7 items.

• Rescheduling with new orders and general maximum allowable time disruptions (Q330107) (← links)
• Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints (Q1751234) (← links)
• A note on competing-agent Pareto-scheduling (Q1996756) (← links)
• Single-machine scheduling with positional due indices and positional deadlines (Q2010931) (← links)
• Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices (Q2190797) (← links)
• ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost (Q2284315) (← links)
• Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine (Q2686863) (← links)