Scheduling unit length jobs on parallel machines with lookahead information

DOI10.1007/s10951-010-0192-yzbMath1229.90063MaRDI QIDQ657255

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

zbMATH Keywords

online algorithms; stochastic dynamic programming; eligibility constraint; lookahead information; multipurpose machine scheduling

Mathematics Subject Classification ID

90C15: Stochastic programming

90B35: Deterministic scheduling theory in operations research

90C39: Dynamic programming

68W27: Online algorithms; streaming algorithms

Related Items

Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead, Makespan minimization in online scheduling with machine eligibility, Makespan minimization in online scheduling with machine eligibility, Online interval scheduling on a single machine with finite lookahead, Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead, Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead, An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times, Exact distributional analysis of online algorithms with lookahead, Online scheduling of two-machine flowshop with lookahead and incompatible job families, Online machine minimization with lookahead, Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence, A review of revenue management: recent generalizations and advances in industry applications, Online scheduling of incompatible unit-length job families with lookahead, Heuristics for online scheduling on identical parallel machines with two GoS levels, Research on the parallel-batch scheduling with linearly lookahead model, Online scheduling on two parallel identical machines under a grade of service provision, Online Integrated Allocation of Berths and Quay Cranes in Container Terminals with 1-Lookahead

Cites Work

• Approximation algorithms for scheduling unrelated parallel machines
• Online and semi-online scheduling of two machines under a grade of service provision
• New algorithms for an ancient scheduling problem.
• On the influence of lookahead in competitive paging algorithms
• Online algorithms: a survey
• Parallel machine scheduling of machine-dependent jobs with unit-length.
• Parallel machine scheduling under a grade of service provision
• New lower and upper bounds for on-line scheduling
• An optimal rounding gives a better approximation for scheduling unrelated machines
• Optimal online algorithms for scheduling on two identical machines under a grade of service
• Scheduling unit length jobs with parallel nested machine processing set restrictions
• Parallel machine scheduling with nested processing set restrictions
• On-Line Load Balancing in a Hierarchical Server Topology
• Scheduling parallel machines with inclusive processing set restrictions
• An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
• Task Scheduling on a Multiprocessor System with Independent Memories
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Competitiveness of On-Line Assignments
• A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS
• Improved Bounds for the Online Scheduling Problem
• A Better Algorithm for an Ancient Scheduling Problem
• Parallel machine scheduling with job assignment restrictions
• Semi-matchings for bipartite graphs and load balancing
• Bounds for Certain Multiprocessing Anomalies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item