Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

ORL
2007

favoriteEmaildiscussreport

86views more ORL 2007»

Complexity of two dual criteria scheduling problems

13 years 10 months ago

Complexity of two dual criteria scheduling problems

Download ems.calumet.purdue.edu

In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. Both problems are single machine scheduling problems and both have the number of tardy jobs as the primary criterion. However, the ﬁrst problem has the total completion time and the second one has the total tardiness as the secondary criterion. We show that both problems are binary NP-hard.

Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao

Real-time Traffic

Complexity Question | Dual Criteria | ORL 2007 | Problems |

claim paper

Related Content

» Complex Goal Criteria and Its Application in DesigntoCriteria Scheduling

» Practical Scheduling Algorithms for Concurrent Transmissions in Rateadaptive Wireless Netw...

» Nonapproximability Results for Scheduling Problems with Minsum Criteria

» Bicriteria scheduling problems Number of tardy jobs and maximum weighted tardiness

» How Well Can PrimalDual and LocalRatio Algorithms Perform

» Mixed Criteria Packet Scheduling

» Criteria for Conceptual and Operational Notions of Complexity

» Minimizing SumMSE Implies Identical Downlink and Dual Uplink Power Allocations

» PrimalDual Affine Scaling Interior Point Methods for Linear Complementarity Problems

Post Info
More Details (n/a)

Added	27 Dec 2010
Updated	27 Dec 2010
Type	Journal
Year	2007
Where	ORL
Authors	Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao

Comments (0)