Pages that link to "Item:Q413308"
From MaRDI portal
The following pages link to Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead (Q413308):
Displaying 12 items.
- Online interval scheduling on a single machine with finite lookahead (Q339562) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- Scheduling unit length jobs on parallel machines with lookahead information (Q657255) (← links)
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead (Q1034639) (← links)
- Online scheduling on a single machine with grouped processing times (Q1723520) (← links)
- Online scheduling of two-machine flowshop with lookahead and incompatible job families (Q2111531) (← links)
- Online machine minimization with lookahead (Q2156292) (← links)
- Online scheduling of incompatible unit-length job families with lookahead (Q2250449) (← links)
- Research on the parallel-batch scheduling with linearly lookahead model (Q2666738) (← links)
- On-line algorithms for incompatible job families on parallel machines scheduling with lookahead (Q2993685) (← 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)