Pages that link to "Item:Q1960313"

The following pages link to Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs (Q1960313):

Displaying 19 items.

• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486) (← links)
• Scheduling on parallel identical machines to minimize total tardiness (Q856206) (← links)
• A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems (Q858325) (← links)
• A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness (Q869149) (← links)
• Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine (Q1266653) (← links)
• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (Q1362988) (← links)
• Single machine scheduling with batch set-up times to minimize maximum lateness (Q1374421) (← links)
• Single machine scheduling to minimize the number of late jobs under uncertainty. (Q1413868) (← links)
• Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria (Q1767711) (← links)
• A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem (Q1771351) (← links)
• Single machine rescheduling for new orders with maximum lateness minimization (Q2147102) (← links)
• Lot scheduling on a single machine to minimize the (weighted) number of tardy orders (Q2203602) (← links)
• Multicriteria scheduling (Q2566699) (← links)
• Fuzzy bi-criteria scheduling on parallel machines involving weighted flow time and maximum tardiness (Q2813467) (← links)
• Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds (Q2845031) (← links)
• Single Machine Scheduling and Selection to Minimize Total Flow Time with Minimum Number Tardy (Q4273247) (← links)
• Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed (Q4661118) (← links)
• Single machine group scheduling with family setups to minimize total tardiness (Q5385473) (← links)