Pages that link to "Item:Q596267"

The following pages link to A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates (Q596267):

Displaying 26 items.

• The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation (Q322969) (← links)
• An investigation on a two-agent single-machine scheduling problem with unequal release dates (Q339650) (← links)
• New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486) (← links)
• A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects (Q497951) (← links)
• Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates (Q632665) (← links)
• Constraint programming approach to a bilevel scheduling problem (Q647473) (← links)
• A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem (Q842556) (← links)
• Heuristic algorithms for a complex parallel machine scheduling problem (Q1022398) (← links)
• Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates (Q1762109) (← links)
• Scheduling a single machine to minimize a regular objective function under setup constraints (Q1779690) (← links)
• A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685) (← links)
• A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times (Q1928272) (← links)
• \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052) (← links)
• A survey of due-date related single-machine with two-agent scheduling problem (Q2190270) (← links)
• On a resource-constrained scheduling problem with application to distributed systems reconfiguration (Q2371345) (← links)
• Dominance-based heuristics for one-machine total cost scheduling problems (Q2384840) (← links)
• A global constraint for total weighted completion time for unary resources (Q2430362) (← links)
• A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time (Q2434288) (← links)
• Minimizing total tardiness on a single machine with unequal release dates (Q2462144) (← links)
• \(\text{MA}\mid\text{PM}\): memetic algorithms with population management (Q2496020) (← links)
• A branch, bound, and remember algorithm for the simple assembly line balancing problem (Q2815457) (← links)
• Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions (Q3166272) (← 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)
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (Q5187929) (← links)