Pages that link to "Item:Q436585"
From MaRDI portal
The following pages link to Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs (Q436585):
Displaying 9 items.
- Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs (Q479220) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- Online batch scheduling with kind release times and incompatible families to minimize makespan (Q1744626) (← links)
- Research on the online batch scheduling to maximize total number of the accepted jobs (Q2951467) (← links)
- Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times (Q3082645) (← links)
- Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery (Q4689384) (← links)
- (Q5115392) (← links)
- Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs (Q5265640) (← links)
- Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components (Q6135731) (← links)