Bicriterion Single Machine Scheduling with Resource Dependent Processing Times

Authors:
T. C. Edwin Cheng;Adam Janiak;Mikhail Y. Kovalyov
Affiliations:
-;-;-
Venue:
SIAM Journal on Optimization
Year:
1998

Citing 0
Cited 20

Multiobjective query optimization

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems

Theoretical Computer Science
Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine

Computers and Operations Research
Convex resource allocation for minimizing the makespan in a single machine with job release dates

Computers and Operations Research
Minimizing the total weighted flow time in a single machine with controllable processing times

Computers and Operations Research
Single Machine Batch Scheduling Problem with Resource Dependent Setup and Processing Time in the Presence of Fuzzy Due Date

Fuzzy Optimization and Decision Making
Pre-Emptive Scheduling Problems with Controllable Processing Times

Journal of Scheduling
Efficiently computing succinct trade-off curves

Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates

Computers and Operations Research
A survey of scheduling with controllable processing times

Discrete Applied Mathematics
A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine

Journal of Scheduling
Bicriteria robotic cell scheduling

Journal of Scheduling
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
The maximum hypervolume set yields near-optimal approximation

Proceedings of the 12th annual conference on Genetic and evolutionary computation
Single-machine group scheduling with resource allocation and learning effect

Computers and Industrial Engineering
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems

SIAM Journal on Computing
Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling

Discrete Applied Mathematics
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates

Journal of Scheduling
Approximation quality of the hypervolume indicator

Artificial Intelligence
A fast approximation-guided evolutionary multi-objective algorithm

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A bicriterion problem of scheduling jobs on a single machine is studied. The processing time of each job is a linear decreasing function of the amount of a common discrete resource allocated to the job. A solution is specified by a sequence of the jobs and a resource allocation. The quality of a solution is measured by two criteria, F1 and F2. The first criterion is the maximal or total (weighted) resource consumption, and the second criterion is a regular scheduling criterion depending on the job completion times. Both criteria have to be minimized. General schemes for the construction of the Pareto set and the Pareto set $\epsilon$-approximation are presented. Computational complexities of problems to minimize F1 subject to F_2\le K$ and to minimize F2 subject to $F_1\le K$, where K is any number, are studied for various functions F1 and F2. Algorithms for solving these problems and for the construction of the Pareto set and the Pareto set $\epsilon$-approximation for the corresponding bicriterion problems are presented.