Complexity of scheduling tasks with time-dependent execution times
Information Processing Letters
Scheduling jobs with step-deterioration; minimizing makespan on a single- and multi-machine
Computers and Industrial Engineering
A note on scheduling on a single processor with speed dependent on a number of executed jobs
Information Processing Letters
The complexity of scheduling starting time dependent tasks with release times
Information Processing Letters
Minimizing the total weighted completion time of deteriorating jobs
Information Processing Letters
A Greedy Approach for a Time-Dependent Scheduling Problem
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Time-Dependent Scheduling
Scheduling Algorithms
| Hi-index | 0.00 |
In the paper, we consider conjugate problems which constitute a new class of mutually related time-dependent scheduling problems. Any element from this class is a composite problem, being a pair of two time-dependent scheduling problems connected by a conjugacy formula. We prove basic properties of conjugate problems and show the relations that hold between such problems. We also propose an approach to the construction of greedy heuristics for the conjugate problems. We illustrate applications of the results by examples.