Online unbounded batch scheduling on parallel machines with delivery times

DOI10.1007/s10878-014-9706-4zbMath1319.90034OpenAlexW1988187934MaRDI QIDQ2354308

Peihai Liu, Xi-wen Lu

Publication date: 10 July 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9706-4

zbMATH Keywords

schedulingcompetitive ratioonline algorithmbatch machinesdelivery times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Online scheduling with delivery time on a bounded parallel batch machine with limited restart, Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions, A best possible algorithm for an online scheduling problem with deteriorating effect in steel box girder section production, Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time, A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions, Online over time scheduling on parallel-batch machines: a survey, Online scheduling on a single machine with linear deteriorating processing times and delivery times, Online scheduling on two parallel machines with release dates and delivery times

Cites Work

• An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
• Online batch scheduling on parallel machines with delivery times
• A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
• An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
• Online scheduling on unbounded parallel-batch machines to minimize the makespan
• On-line scheduling with delivery time on a single batch machine
• Approximation algorithms in batch processing
• Scheduling one batch processor subject to job release dates
• 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
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine