Scheduling unit length jobs on parallel machines with lookahead information
From MaRDI portal
Publication:657255
DOI10.1007/S10951-010-0192-YzbMATH Open1229.90063OpenAlexW2016377900MaRDI QIDQ657255FDOQ657255
Marvin Mandelbaum, Dvir Shabtay
Publication date: 16 January 2012
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-010-0192-y
online algorithmsstochastic dynamic programmingeligibility constraintlookahead informationmultipurpose machine scheduling
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Stochastic programming (90C15)
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Title not available (Why is that?)
- The Competitiveness of On-Line Assignments
- Bounds for Certain Multiprocessing Anomalies
- Approximation algorithms for scheduling unrelated parallel machines
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- New algorithms for an ancient scheduling problem.
- Title not available (Why is that?)
- Online algorithms: a survey
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- On-line load balancing in a hierarchical server topology
- Parallel machine scheduling with job assignment restrictions
- Online and semi-online scheduling of two machines under a grade of service provision
- Parallel machine scheduling under a grade of service provision
- Scheduling parallel machines with inclusive processing set restrictions
- Improved Bounds for the Online Scheduling Problem
- Semi-matchings for bipartite graphs and load balancing
- On the influence of lookahead in competitive paging algorithms
- New lower and upper bounds for on-line scheduling
- A Better Algorithm for an Ancient Scheduling Problem
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Scheduling unit length jobs with parallel nested machine processing set restrictions
- Parallel machine scheduling with nested processing set restrictions
- Task Scheduling on a Multiprocessor System with Independent Memories
- A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- Title not available (Why is that?)
Cited In (19)
- Makespan minimization in online scheduling with machine eligibility
- Semi-online scheduling on two identical parallel machines with initial-lookahead information
- Online scheduling of two-machine flowshop with lookahead and incompatible job families
- Heuristics for online scheduling on identical parallel machines with two GoS levels
- Semi-online scheduling on two uniform parallel machines with initial lookahead
- Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead
- Online scheduling of incompatible unit-length job families with lookahead
- A review of revenue management: recent generalizations and advances in industry applications
- Online machine minimization with lookahead
- Online scheduling on two parallel identical machines under a grade of service provision
- Exact distributional analysis of online algorithms with lookahead
- Online interval scheduling on a single machine with finite lookahead
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
- Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly 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
- Makespan minimization in online scheduling with machine eligibility
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
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 👍 👎
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)
