Pages that link to "Item:Q2643797"
From MaRDI portal
The following pages link to Complexity of two dual criteria scheduling problems (Q2643797):
Displayed 9 items.
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness (Q856204) (← links)
- New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs (Q1044141) (← links)
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs (Q2029301) (← links)
- Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion (Q2030503) (← links)
- Scheduling to tradeoff between the number and the length of accepted jobs (Q2235744) (← links)
- Single-machine multi-agent scheduling problems with a global objective function (Q2434286) (← links)
- BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS (Q3397512) (← links)
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)