Pages that link to "Item:Q2026708"

The following pages link to Minmax scheduling and due-window assignment with position-dependent processing times and job rejection (Q2026708):

Displaying 8 items.

• A greedy heuristic for solving scheduling problems with bounded rejection cost (Q2147117) (← links)
• Single machine scheduling with non-availability interval and optional job rejection (Q2168742) (← links)
• Scheduling with competing agents, total late work and job rejection (Q2668778) (← links)
• Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times (Q2688577) (← links)
• Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine (Q6094568) (← links)
• Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection (Q6204202) (← links)
• A note: minmax due-window assignment with fixed earliness-tardiness costs (Q6593204) (← links)
• Minmax common due-window assignment scheduling with deteriorating jobs (Q6601968) (← links)