Pages that link to "Item:Q1362988"

The following pages link to Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (Q1362988):

Displaying 21 items.

• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models (Q660815) (← links)
• Single-machine scheduling with trade-off between number of tardy jobs and compression cost (Q835563) (← links)
• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine (Q954246) (← links)
• Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← links)
• A multi-objective approach to resource allocation in single machine scheduling (Q1173857) (← links)
• Single machine scheduling with discretely controllable processing times (Q1373460) (← links)
• Minimizing completion time variance with compressible processing times (Q1781972) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• Inverse interval scheduling via reduction on a single machine (Q2158006) (← links)
• Scheduling two projects with controllable processing times in a single-machine environment (Q2215194) (← links)
• Scheduling to tradeoff between the number and the length of accepted jobs (Q2235744) (← links)
• A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine (Q2294390) (← links)
• A survey of scheduling with controllable processing times (Q2381529) (← links)
• Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine (Q2434305) (← links)
• Multicriteria scheduling (Q2566699) (← links)
• Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect (Q2954339) (← links)
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy (Q4205229) (← links)
• A hybrid heuristic approach to minimize number of tardy jobs in group technology systems (Q6066616) (← links)
• Two‐agent scheduling with linear resource‐dependent processing times (Q6072167) (← links)
• Single-machine scheduling of multiple projects with controllable processing times (Q6167669) (← links)