Online scheduling of two-machine flowshop with lookahead and incompatible job families
From MaRDI portal
Publication:2111531
DOI10.1007/s10878-022-00974-8OpenAlexW4313814164MaRDI QIDQ2111531
Publication date: 17 January 2023
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00974-8
competitive ratioonline algorithmparallel-batch schedulingincompatible job familieslookahead interval
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
- Scheduling unit length jobs on parallel machines with lookahead information
- Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
- 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
- Online scheduling to minimize total weighted (modified) earliness and tardiness cost
- A survey of scheduling with parallel batch (p-batch) processing
- Online scheduling of incompatible unit-length job families with lookahead
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
- On-line algorithms for minimizing makespan on batch processing machines
- An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart
- Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead
This page was built for publication: Online scheduling of two-machine flowshop with lookahead and incompatible job families
