Pages that link to "Item:Q657255"
From MaRDI portal
The following pages link to Scheduling unit length jobs on parallel machines with lookahead information (Q657255):
Displayed 17 items.
- Online interval scheduling on a single machine with finite lookahead (Q339562) (← links)
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead (Q413308) (← links)
- Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead (Q721944) (← links)
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times (Q1926488) (← links)
- Exact distributional analysis of online algorithms with lookahead (Q2044551) (← links)
- Online scheduling of two-machine flowshop with lookahead and incompatible job families (Q2111531) (← links)
- Online machine minimization with lookahead (Q2156292) (← links)
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence (Q2165267) (← links)
- A review of revenue management: recent generalizations and advances in industry applications (Q2178060) (← links)
- Online scheduling of incompatible unit-length job families with lookahead (Q2250449) (← links)
- Heuristics for online scheduling on identical parallel machines with two GoS levels (Q2320626) (← links)
- Research on the parallel-batch scheduling with linearly lookahead model (Q2666738) (← links)
- Online scheduling on two parallel identical machines under a grade of service provision (Q2683376) (← links)
- Online Integrated Allocation of Berths and Quay Cranes in Container Terminals with 1-Lookahead (Q3196402) (← links)
- Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead (Q5241278) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)