Optimal on-line algorithms for one batch machine with grouped processing times
From MaRDI portal
Publication:411231
DOI10.1007/s10878-010-9298-6zbMath1236.90052MaRDI QIDQ411231
Peihai Liu, Yang Fang, Xi-wen Lu
Publication date: 4 April 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9298-6
90B35: Deterministic scheduling theory in operations research
Related Items
Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval, Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine, An improved on-line algorithm for single parallel-batch machine scheduling with delivery times, Online over time scheduling on parallel-batch machines: a survey, Online scheduling with delivery time on a bounded parallel batch machine with limited restart, Online scheduling on a single machine with grouped processing times, An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times, Single-machine online scheduling of jobs with non-delayed processing constraint, Online algorithms to schedule a proportionate flexible flow shop of batching machines, Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart, Online NDP-constraint scheduling of jobs with delivery times or weights
Cites Work
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
- On-line scheduling with delivery time on a single batch machine
- Scheduling a batching machine
- Approximation algorithms in batch processing
- Scheduling one batch processor subject to job release dates
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- On-line scheduling algorithms for a batch machine with finite capacity
- On-line algorithms for minimizing makespan on batch processing machines
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
