Pages that link to "Item:Q5241278"
From MaRDI portal
The following pages link to Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead (Q5241278):
Displaying 6 items.
- 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)
- Research on the parallel-batch scheduling with linearly lookahead model (Q2666738) (← links)
- Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval (Q6053500) (← links)
- Semi-online scheduling on two identical parallel machines with initial-lookahead information (Q6561561) (← links)
- Semi-online scheduling on two uniform parallel machines with initial lookahead (Q6594037) (← links)