Pages that link to "Item:Q1197646"

The following pages link to Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem (Q1197646):

Displayed 6 items.

• A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates (Q596267) ‎ (← links)
• A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem (Q842556) ‎ (← links)
• Scheduling a single machine to minimize a regular objective function under setup constraints (Q1779690) ‎ (← links)
• Dominance-based heuristics for one-machine total cost scheduling problems (Q2384840) ‎ (← links)
• Minimizing total tardiness on a single machine with unequal release dates (Q2462144) ‎ (← links)
• A new dominance rule to minimize total weighted tardiness with unequal release dates. (Q5952443) ‎ (← links)