Pages that link to "Item:Q392015"

The following pages link to On an extension of the Sort \& Search method with application to scheduling theory (Q392015):

Displaying 11 items.

• New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184) (← links)
• A characterization of optimal multiprocessor schedules and new dominance rules (Q830925) (← links)
• On the optimality of exact and approximation algorithms for scheduling problems (Q1635503) (← links)
• Exact exponential algorithms for 3-machine flowshop scheduling problems (Q1743653) (← links)
• An exact exponential branch-and-merge algorithm for the single machine total tardiness problem (Q1786599) (← links)
• Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
• Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms (Q2242051) (← links)
• Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights (Q2307497) (← links)
• Minimizing the number of tardy jobs in two-machine settings with common due date (Q2410033) (← links)
• Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)
• A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics (Q6089980) (← links)