Optimal semi-online algorithm for scheduling on two parallel batch processing machines

DOI10.1142/S0217595914500389MaRDI QIDQ2931174zbMATH OpenOpenAlexWikidataFDO

Authors Ming Liu, Feifeng Zheng, Zhanguo Zhu, Chengbin Chu

Publication date 24 November 2014

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

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

zbMATH Keywords

batch processing machinescompetitive analysisonline algorithmscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine
• OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
• OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING
• An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
• Best semi-online algorithms for unbounded parallel batch scheduling

Cites work

• A best online algorithm for scheduling on two parallel batch machines
• An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
• Approximation algorithms in batch processing
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• On-line algorithms for minimizing makespan on batch processing machines
• On-line scheduling algorithms for a batch machine with finite capacity
• On-line scheduling on a batch machine to minimize makespan with limited restarts
• Online scheduling in a parallel batch processing system to minimize makespan using restarts

Cited in

(9)

• OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
• scientific article; zbMATH DE number 5669942 (Why is no real title available?)
• Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine
• Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing
• OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING
• An optimal on-line algorithm for a parallel-batching scheduling with non-increasing processing time jobs
• A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs
• An optimal semi-online algorithm for 2-machine scheduling with an availability constraint
• Optimal preemptive semi-online scheduling on two uniform processors

This page was built for publication: Optimal semi-online algorithm for scheduling on two parallel batch processing machines

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