Scheduling unit length jobs on parallel machines with lookahead information
From MaRDI portal
(Redirected from Publication:657255)
Recommendations
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
- Online algorithms for scheduling unit length jobs on unbounded parallel-batch machines with linearly lookahead
- Online scheduling of incompatible unit-length job families with lookahead
- Online interval scheduling on two related machines: the power of lookahead
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
Cites work
- scientific article; zbMATH DE number 1634827 (Why is no real title available?)
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 910900 (Why is no real title available?)
- A Better Algorithm for an Ancient Scheduling Problem
- A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Approximation algorithms for scheduling unrelated parallel machines
- Bounds for Certain Multiprocessing Anomalies
- Improved Bounds for the Online Scheduling Problem
- New algorithms for an ancient scheduling problem.
- New lower and upper bounds for on-line scheduling
- On the influence of lookahead in competitive paging algorithms
- On-line load balancing in a hierarchical server topology
- Online algorithms: a survey
- Online and semi-online scheduling of two machines under a grade of service provision
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- Parallel machine scheduling problem with two GoS levels
- Parallel machine scheduling under a grade of service provision
- Parallel machine scheduling with job assignment restrictions
- Parallel machine scheduling with nested processing set restrictions
- Scheduling parallel machines with inclusive processing set restrictions
- Scheduling unit length jobs with parallel nested machine processing set restrictions
- Semi-matchings for bipartite graphs and load balancing
- Task Scheduling on a Multiprocessor System with Independent Memories
- The Competitiveness of On-Line Assignments
Cited in
(20)- Exact distributional analysis of online algorithms with lookahead
- Makespan minimization in online scheduling with machine eligibility
- Online scheduling of incompatible unit-length job families with lookahead
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
- Online scheduling of two-machine flowshop with lookahead and incompatible job families
- Makespan minimization in online scheduling with machine eligibility
- Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead
- Semi-online scheduling on two uniform parallel machines with initial lookahead
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
- Online interval scheduling on two related machines: the power of lookahead
- Heuristics for online scheduling on identical parallel machines with two GoS levels
- Online scheduling on two parallel identical machines under a grade of service provision
- A review of revenue management: recent generalizations and advances in industry applications
- Online interval scheduling on a single machine with finite lookahead
- Research on the parallel-batch scheduling with linearly lookahead model
- Online Integrated Allocation of Berths and Quay Cranes in Container Terminals with 1-Lookahead
- Online algorithms for scheduling unit length jobs on unbounded parallel-batch machines with linearly lookahead
- Semi-online scheduling on two identical parallel machines with initial-lookahead information
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
- Online machine minimization with lookahead
This page was built for publication: Scheduling unit length jobs on parallel machines with lookahead information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657255)
