Research on the parallel-batch scheduling with linearly lookahead model
From MaRDI portal
Publication:2666738
DOI10.3934/jimo.2020132zbMath1476.90124OpenAlexW3047042250MaRDI QIDQ2666738
Publication date: 23 November 2021
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2020132
Deterministic scheduling theory in operations research (90B35) Stochastic scheduling theory in operations research (90B36)
Related Items (1)
Cites Work
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
- Scheduling unit length jobs on parallel machines with lookahead information
- How much can lookahead help in online single machine scheduling
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
- A look-ahead heuristic for scheduling jobs with release dates on a single machine
- Approximation algorithms in batch processing
- On-line scheduling algorithms for a batch machine with finite capacity
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- On-line algorithms for minimizing makespan on batch processing machines
- Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead
This page was built for publication: Research on the parallel-batch scheduling with linearly lookahead model
