An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines

DOI10.1016/j.orl.2008.03.004zbMath1210.90094OpenAlexW2030921117MaRDI QIDQ957356

B. E. Eshmatov

Publication date: 27 November 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10397/1267

zbMATH Keywords

batchparallel machinescompetitive ratioworst-case analysison-line scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart, A best possible on-line algorithm for scheduling on uniform parallel-batch machines, Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines, Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead, Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time, A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines, Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan, Online over time scheduling on parallel-batch machines: a survey, Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart, Online scheduling on unbounded parallel-batch machines with incompatible job families, Online scheduling on unbounded parallel-batch machines to minimize the makespan, A best online algorithm for scheduling on two parallel batch machines, Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan, Online unbounded batch scheduling on parallel machines with delivery times

Cites Work

• Unnamed Item
• The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
• Scheduling a batching machine
• Scheduling one batch processor subject to job release dates
• A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints
• The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
• Minimizing makespan on a single batching machine with release times and non-identical job sizes
• 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
• Scheduling a single batch processing machine with non-identical job sizes
• Single machine parallel batch scheduling subject to precedence constraints