A Greedy Approach for a Time-Dependent Scheduling Problem

Authors:
Stanislaw Gawiejnowicz;Wieslaw Kurc;Lidia Pankowska
Affiliations:
-;-;-
Venue:
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Year:
2001

Citing 4
Cited 4

V-shaped policies for scheduling deteriorating jobs

Operations Research
Scheduling jobs under simple linear deterioration

Computers and Operations Research
Scheduling jobs with varying processing times

Information Processing Letters
Parallel machine scheduling with time dependent processing times

Discrete Applied Mathematics

Pareto and scalar bicriterion optimization in scheduling deteriorating jobs

Computers and Operations Research
Scheduling algorithms for procrastinators

Journal of Scheduling
Conjugate problems in time-dependent scheduling

Journal of Scheduling
Pareto and scalar bicriterion optimization in scheduling deteriorating jobs

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main aim of the paper is to construct a greedy algorithm for an approximate polynomial-time solution of a single machine time-dependent scheduling problem. In the problem the processing time pj of each job is described by a function of the starting time t of the job, pj = 1+驴j t, where 驴j 0 for j = 0, 1, 2, ..., n. Jobs are non-preemptable and independent, there are neither ready times nor deadlines, and the criterion of optimality is the total completion time.There are two contributions of the paper. Firstly, some theoretical background for proposed algorithm is presented. In this setting useful notions of signatures for a given sequence of coefficients of the problem are introduced and their properties are considered. Secondly, these general results are applied to the case of the problem when its coefficients are consecutive natural numbers.