Pages that link to "Item:Q1694821"
From MaRDI portal
The following pages link to Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821):
Displaying 13 items.
- Scheduling jobs with release times on a machine with finite storage (Q1330556) (← links)
- Job release scheduling problem: complexity and an approximation algorithm (Q1946231) (← links)
- 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)
- Minimizing makespan on a single batching machine with release times and non-identical job sizes (Q2488218) (← links)
- Approximations and auctions for scheduling batches on related machines (Q2643820) (← 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)
- Bounds for naive multiple machine scheduling with release times and deadlines (Q3319773) (← links)
- An NC Algorithm for Scheduling Unit-Time Jobs with Arbitrary Release Times and Deadlines (Q4286236) (← links)
- Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines (Q6049692) (← links)
