Pages that link to "Item:Q1341403"

The following pages link to Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property (Q1341403):

Displaying 23 items.

• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• A study of single-machine scheduling problem to maximize throughput (Q398860) (← links)
• New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486) (← links)
• Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287) (← links)
• Minimizing the weighted number of tardy jobs on a single machine with release dates (Q852934) (← links)
• Genetic algorithms to minimize the weighted number of late jobs on a single machine. (Q1410613) (← links)
• Preemptive scheduling of equal-length jobs to maximize weighted throughput. (Q1426730) (← links)
• Throughput maximization for speed scaling with agreeable deadlines (Q1702723) (← links)
• Using short-term memory to minimize the weighted number of late jobs on a single machine. (Q1812007) (← links)
• A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685) (← links)
• Branch less, cut more and minimize the number of late equal-length jobs on identical machines (Q1929241) (← links)
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times (Q1964481) (← links)
• A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints (Q2256319) (← links)
• Modeling single machine preemptive scheduling problems for computational efficiency (Q2288995) (← links)
• Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm (Q2377225) (← links)
• Parallel machine problems with equal processing times: a survey (Q2434248) (← links)
• Optimality proof of the Kise-Ibaraki-Mine algorithm (Q2434284) (← links)
• Online scheduling of bounded length jobs to maximize throughput (Q2434304) (← links)
• A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates (Q2482800) (← links)
• Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals (Q2765599) (← links)
• Single machine scheduling with deadlines, release and due dates (Q4375438) (← links)
• Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine (Q4432721) (← links)
• Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)