Pages that link to "Item:Q852934"

The following pages link to Minimizing the weighted number of tardy jobs on a single machine with release dates (Q852934):

Displaying 28 items.

• Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation (Q319939) (← links)
• 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)
• Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs (Q633558) (← links)
• Constraint programming approach to a bilevel scheduling problem (Q647473) (← links)
• Scheduling linear deteriorating jobs to minimize the number of tardy jobs (Q693149) (← links)
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries (Q763109) (← links)
• Minimizing the number of tardy job units under release time constraints (Q919993) (← links)
• Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances (Q969755) (← links)
• Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs (Q1043248) (← links)
• Minimizing the weighted number of tardy jobs on a two-machine flow shop. (Q1413849) (← links)
• A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs (Q1667779) (← links)
• A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem (Q1686431) (← links)
• Using short-term memory to minimize the weighted number of late jobs on a single machine. (Q1812007) (← links)
• Minimizing the weighted number of tardy jobs on a single machine (Q1869424) (← links)
• A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685) (← links)
• Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances (Q2076814) (← 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)
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains (Q2355078) (← links)
• Minimizing the number of tardy jobs in two-machine settings with common due date (Q2410033) (← links)
• A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates (Q2482800) (← links)
• Unrelated parallel machine scheduling with new criteria: complexity and models (Q2668730) (← links)
• Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine (Q4432721) (← links)
• A heuristic algorithm to minimize total weighted tardiness on a single machine with release times (Q4670675) (← links)
• Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling (Q5087720) (← links)
• A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty (Q6103748) (← links)
• Server cloud scheduling (Q6130327) (← links)