An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart

DOI10.1142/S0217595921500111zbMath1481.90179OpenAlexW3135770504MaRDI QIDQ5024917

Hailing Liu, Xi-wen Lu

Publication date: 1 February 2022

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595921500111

zbMATH Keywords

online schedulinglimited restartparallel batchdeliverydrop-line

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Online scheduling of two-machine flowshop with lookahead and incompatible job families

Cites Work

• Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart
• Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time
• On-line scheduling on a batch machine to minimize makespan with limited restarts
• The coordination of transportation and batching scheduling
• Approximation algorithms in batch processing
• Unbounded parallel-batch scheduling with drop-line tasks
• On-line algorithms for minimizing makespan on batch processing machines
• The Batch Loading and Scheduling Problem
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Scheduling Parallel Machines On-Line
• Minimizing the total completion time on-line on a single machine, using restarts

This page was built for publication: An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart