Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time

Authors:
J. A. Hoogeveen;S. L. Van De Velde
Affiliations:
Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, Netherlands;Department of Mechanical Engineering, University of Twente, P.O. Box 217, 7500 AE Enschede, Netherlands
Venue:
Operations Research Letters
Year:
1995

Citing 2
Cited 14

Scheduling with multiple performance measures: the one-machine case

Management Science
Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty

Computers and Operations Research

Existence theorems, lower bounds and algorithms for scheduling to meet two objectives

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Common due date assignment and scheduling with ready times

Computers and Operations Research
Simultaneously optimizing two scheduling objectives

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Experimental analysis of online algorithms for the bicriteria scheduling problem

Journal of Parallel and Distributed Computing
Pareto approximations for the bicriteria scheduling problem

Journal of Parallel and Distributed Computing
Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan

Theoretical Computer Science
Pareto optima for total weighted completion time and maximum lateness on a single machine

Discrete Applied Mathematics
Mixed Criteria Packet Scheduling

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
A DP algorithm for minimizing makespan and total completion time on a series-batching machine

Information Processing Letters
Experimental analysis of online algorithms for the bicriteria scheduling problem

WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments

Discrete Applied Mathematics
On the existence of schedules that are near-optimal for both makespan and total weighted completion time

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

Journal of Scheduling
Note: Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that the bicriteria single-machine scheduling problem of minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Our result settles a long-standing open problem.