Pages that link to "Item:Q2250449"
From MaRDI portal
The following pages link to Online scheduling of incompatible unit-length job families with lookahead (Q2250449):
Displaying 5 items.
- Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time (Q1617277) (← links)
- Online scheduling of two-machine flowshop with lookahead and incompatible job families (Q2111531) (← links)
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence (Q2165267) (← links)
- Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead (Q5241278) (← links)
- Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval (Q6053500) (← links)