Pages that link to "Item:Q3166272"

The following pages link to Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions (Q3166272):

Displaying 21 items.

• Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness (Q295879) (← links)
• A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates (Q596267) (← links)
• A branch and bound algorithm to minimize total weighted tardiness on a single processor (Q596449) (← links)
• Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates (Q632665) (← links)
• Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs (Q633558) (← links)
• A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF (Q779440) (← links)
• A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (Q941541) (← links)
• Lower bounds for parallel machine scheduling problems (Q947338) (← links)
• Scheduling parallel machines to minimize total weighted and unweighted tardiness (Q1370670) (← links)
• Scheduling unrelated parallel machines to minimize total weighted tardiness. (Q1413838) (← 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 parallel processors (Q1887912) (← links)
• Mathematical model and algorithm for the reefer mechanic scheduling problem at seaports (Q2398778) (← links)
• Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods (Q2430608) (← links)
• A new branch and bound algorithm for minimizing the weighted number of tardy jobs (Q2638922) (← links)
• A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines (Q2942689) (← links)
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem (Q3682221) (← links)
• A branch-and-bound algorithm to minimize total tardiness with different release dates (Q3993992) (← links)
• (Q4017560) (← links)
• A heuristic algorithm to minimize total weighted tardiness on a single machine with release times (Q4670675) (← links)
• Dynamic scheduling of patients in emergency departments (Q6113312) (← links)