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-5MaRDI QIDQ479220zbMATH OpenOpenAlexFDO

Authors Jinjiang Yuan, Wenjie 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

online algorithmsschedulingincompatible familiespreemption-restart

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
• Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs
• Online scheduling on unbounded parallel-batch machines with incompatible job families
• scientific article; zbMATH DE number 7235424
• Online scheduling of incompatible family jobs with equal length on an unbounded parallel-batch machine with job delivery

Cites work

• Algorithms - ESA 2003
• Computing and Combinatorics
• Design and analysis of online batching systems
• Improved on-line broadcast scheduling with deadlines
• On-line scheduling of jobs with fixed start and end times
• Online interval scheduling: Randomized and multiprocessor cases
• Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling broadcasts with deadlines
• Scheduling with batching: A review

Cited in

(10)

• Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs
• Research on the online batch scheduling to maximize total number of the accepted jobs
• Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types
• Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
• Online parallel-machine scheduling in KRT environment to minimize total weighted completion time
• scientific article; zbMATH DE number 7235424 (Why is no real title available?)
• Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components
• Online batch scheduling with kind release times and incompatible families to minimize makespan
• Online scheduling of incompatible family jobs with equal length on an unbounded parallel-batch machine with job delivery
• Online scheduling on bounded batch machines to minimize the maximum weighted completion time

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479220)