Pages that link to "Item:Q4156114"

The following pages link to A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times (Q4156114):

Displaying 44 items.

• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• Scheduling satellite launch missions: an MILP approach (Q398832) (← links)
• New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486) (← links)
• Efficient job scheduling algorithms with multi-type contentions (Q813335) (← links)
• Minimizing the weighted number of tardy jobs on a single machine with release dates (Q852934) (← links)
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q922286) (← links)
• Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine (Q1037662) (← links)
• Efficient scheduling algorithms for a single batch processing machine (Q1077325) (← links)
• Minimizing late jobs in the general one machine scheduling problem (Q1130035) (← links)
• Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties (Q1278719) (← links)
• An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q1306357) (← links)
• Parallel machine scheduling to minimize costs for earliness and number of tardy jobs (Q1315994) (← links)
• Single-machine scheduling to minimize earliness and number of tardy jobs (Q1321352) (← links)
• An optimal scheduling algorithm for preemptable real-time tasks (Q1321836) (← links)
• An ordered independence system and its applications to scheduling problems (Q1330565) (← links)
• Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property (Q1341403) (← links)
• Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs (Q1342333) (← links)
• Online real-time preemptive scheduling of jobs with deadlines on multiple machines (Q1348736) (← links)
• Genetic algorithms to minimize the weighted number of late jobs on a single machine. (Q1410613) (← links)
• Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance (Q1761146) (← 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)
• A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs (Q1891237) (← links)
• A revised proof of the optimality for the Kise-Ibaraki-Mine algorithm (Q1926639) (← 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)
• Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm (Q2377225) (← links)
• Optimality proof of the Kise-Ibaraki-Mine algorithm (Q2434284) (← links)
• Shiftable intervals (Q2480206) (← links)
• A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates (Q2482800) (← links)
• Scheduling orders for multiple product types with due date related objectives (Q2569034) (← links)
• Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals (Q2765599) (← links)
• Algorithms for Necklace Maps (Q2950591) (← links)
• Effective heuristics for the single machine sequencing problem with ready times (Q3352822) (← 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)
• Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs (Q4842698) (← links)
• Throughput scheduling with equal additive laxity (Q5918523) (← links)
• Throughput scheduling with equal additive laxity (Q5925675) (← links)
• Single machine scheduling with release times, deadlines and tardiness objectives (Q5946156) (← links)
• Minimizing the number of tardy jobs with precedence constraints and agreeable due dates (Q5961612) (← links)
• Optimal admission control of discrete event systems with real-time constraints (Q5962023) (← links)
• A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty (Q6103748) (← links)
• Maximizing the number of rides served for time-limited Dial-a-Ride* (Q6661115) (← links)