Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs
From MaRDI portal
Publication:5265640
DOI10.1080/00207721.2013.794904zbMath1332.90120OpenAlexW2160696156MaRDI QIDQ5265640
Publication date: 28 July 2015
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207721.2013.794904
Related Items (1)
Cites Work
- Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
- Improved on-line broadcast scheduling with deadlines
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
- Scheduling broadcasts with deadlines
- Design and analysis of online batching systems
- Minimising makespan for two batch-processing machines with non-identical job sizes in job shop
- Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
- The Batch Loading and Scheduling Problem
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
This page was built for publication: Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs