Pages that link to "Item:Q2576877"
From MaRDI portal
The following pages link to Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine (Q2576877):
Displaying 12 items.
- Bi-criteria scheduling on a single parallel-batch machine (Q437901) (← links)
- The coordination of transportation and batching scheduling (Q965544) (← links)
- Scheduling jobs with release dates on parallel batch processing machines (Q1026144) (← links)
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time (Q2184132) (← links)
- Unbounded parallel-batch scheduling with drop-line tasks (Q2304116) (← links)
- Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan (Q2439519) (← links)
- Efficient approximation schemes for scheduling problems with release dates and delivery times (Q2464403) (← 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)
- TWO-STAGE FLOWSHOP SCHEDULING PROBLEMS WITH IDENTICAL AND BATCH PROCESSORS (Q3069763) (← links)
- Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times (Q3082645) (← links)
- (Q3569627) (← links)
