Complexity of two dual criteria scheduling problems

Authors:
Yumei Huo;J. Y. -T. Leung;Hairong Zhao
Affiliations:
Department of Computer Science, College of Staten Island, CUNY, Staten Island, New York 10314, USA;Department of Computer Science, New Jersey Institute of Technology, Newark NJ 07102, USA;Department of Mathematics, Computer Science & Statistics, Purdue University, Calumet 2200 169th Street, Hammond, IN 46323, USA
Venue:
Operations Research Letters
Year:
2007

Citing 6
Cited 3

One-processor scheduling with symmetric earliness and tardiness penalties

Mathematics of Operations Research
Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
Scheduling Algorithms

Scheduling Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Multicriteria Scheduling: Theory, Models and Algorithms

Multicriteria Scheduling: Theory, Models and Algorithms
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

Bicriteria Scheduling on Single-Machine with Inventory Operations

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Competitive Two-Agent Scheduling and Its Applications

Operations Research
Single-machine multi-agent scheduling problems with a global objective function

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. We show that both problems are binary NP-hard.