The following pages link to (Q5115392):
Displaying 7 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 scheduling on unbounded parallel-batch machines with incompatible job families (Q533882) (← links)
- Online batch scheduling with kind release times and incompatible families to minimize makespan (Q1744626) (← links)
- Online scheduling of two-machine flowshop with lookahead and incompatible job families (Q2111531) (← links)
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan (Q2450605) (← links)
- Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery (Q4689384) (← links)
- Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components (Q6135731) (← links)