Pages that link to "Item:Q4432721"

The following pages link to Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine (Q4432721):

Displaying 16 items.

• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486) (← links)
• Constraint programming approach to a bilevel scheduling problem (Q647473) (← links)
• Maximizing the weighted number of just-in-time jobs in flow shop scheduling (Q835569) (← links)
• Minimizing the weighted number of tardy jobs on a single machine with release dates (Q852934) (← links)
• Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances (Q969755) (← links)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
• A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints (Q2256319) (← links)
• Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
• Scheduling jobs on parallel machines to minimize a regular step total cost function (Q2434254) (← links)
• Pareto optima for total weighted completion time and maximum lateness on a single machine (Q2457015) (← links)
• A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates (Q2482800) (← links)
• New MIP model for multiprocessor scheduling problem with communication delays (Q5915741) (← 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)
• Minimizing the sum of completion times on a single machine with health index and flexible maintenance operations (Q6109303) (← links)