scientific article; zbMATH DE number 2080978

zbMATH Open1077.90524MaRDI QIDQ4474073FDOQ4474073

Authors: Jingui Huang, Jianer Chen 

Publication date: 4 August 2004

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

Title of this publication is not available (Why is that?)

Recommendations

• A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
• A simple linear time approximation algorithm for multi-processor job scheduling on four processors
• scientific article; zbMATH DE number 2080235
• A polynomial time approximation scheme for general multiprocessor job scheduling
• Semi-on-line multiprocessor scheduling with given total processing time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Cited In (5)

• Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates
• A simple linear time approximation algorithm for multi-processor job scheduling on four processors
• Lower bound algorithms for multiprocessor task scheduling with ready times
• A short note on an advance in estimating the worst-case performance ratio of the MPS algorithm
• Title not available (Why is that?)

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 Q4474073)