scientific article; zbMATH DE number 2081006

MaRDI QIDQ4474104zbMATH OpenFDO

Authors Bo Chen, Wenan Zang, Xiaotie Deng

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2223/22230380.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• On-line scheduling a batch processing system to minimize total weighted job completion time
• Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
• Online scheduling on bounded batch machines to minimize the maximum weighted completion time
• On-line algorithms for minimizing makespan on batch processing machines
• Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine

Cited in

(6)

• On-line scheduling a batch processing system to minimize total weighted job completion time
• Minimizing mean completion time in a batch processing system
• A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
• Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
• An algorithm of minimizing the total weighted completed time on batch processing machine
• An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines

This page was built for publication:

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