Pages that link to "Item:Q1694821"

The following pages link to Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821):

Displayed 7 items.

• Column generation for minimizing total completion time in a parallel-batching environment (Q2066680) ‎ (← links)
• A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time (Q2184132) ‎ (← links)
• Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines (Q2297575) ‎ (← links)
• When serial batch scheduling involves parallel batching decisions: a branch and price scheme (Q2669619) ‎ (← links)
• Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine (Q2669805) ‎ (← links)
• Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines (Q2693572) ‎ (← links)
• Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines (Q6049692) ‎ (← links)