Optimal on-line algorithms for one batch machine with grouped processing times

DOI10.1007/S10878-010-9298-6MaRDI QIDQ411231zbMATH OpenOpenAlexFDO

Authors Yang Fang, Peihai Liu, Xiwen 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

zbMATH Keywords

schedulingdelivery timeon-line algorithmbatching

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• On-line scheduling with delivery time on a single batch machine
• On-line algorithms for minimizing makespan on batch processing machines
• On-line algorithms for minimizing makespan and maximum delivery time on a single serial batch machine
• OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
• Online batch scheduling on parallel machines with delivery times

Cites work

• A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
• A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
• A flexible on-line scheduling algorithm for batch machine with infinite capacity
• Approximation algorithms in batch processing
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• On-line algorithms for minimizing makespan on batch processing machines
• On-line scheduling algorithms for a batch machine with finite capacity
• On-line scheduling with delivery time on a single batch machine
• Scheduling a batching machine
• Scheduling one batch processor subject to job release dates

Cited in

(20)

• Online algorithms to schedule a proportionate flexible flow shop of batching machines
• A flexible on-line scheduling algorithm for batch machine with infinite capacity
• 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 on-line algorithm for the bounded \(P\)-batch scheduling with chain precedence constraints and unit processing time
• An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
• Online scheduling on a single machine with grouped processing times
• OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
• An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
• On-line algorithms for minimizing makespan on batch processing machines
• Online scheduling with delivery time on a bounded parallel batch machine with limited restart
• On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
• Single-machine online scheduling of jobs with non-delayed processing constraint
• Online over time scheduling on parallel-batch machines: a survey
• Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine
• Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart
• Online Single Machine Batch Scheduling
• Online NDP-constraint scheduling of jobs with delivery times or weights
• Algorithm Theory - SWAT 2004
• Optimally competitive list batching

This page was built for publication: Optimal on-line algorithms for one batch machine with grouped processing times

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