Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs

DOI10.1007/s11590-013-0650-5zbMath1310.90046OpenAlexW2040397633MaRDI QIDQ479220

Jinjiang Yuan, Wen-Jie Li

Publication date: 5 December 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-013-0650-5

zbMATH Keywords

schedulingonline algorithmsincompatible familiespreemption-restart

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types ⋮ Online scheduling on bounded batch machines to minimize the maximum weighted completion time ⋮ Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time ⋮ Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery

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 interval scheduling: Randomized and multiprocessor cases
• On-line scheduling of jobs with fixed start and end times
• Scheduling broadcasts with deadlines
• Scheduling with batching: A review
• Design and analysis of online batching systems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Computing and Combinatorics
• Algorithms - ESA 2003

This page was built for publication: Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs