Single facility scheduling with nonlinear processing times
Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor
Operations Research
V-shaped policies for scheduling deteriorating jobs
Operations Research
Scheduling jobs under simple linear deterioration
Computers and Operations Research
Two machine open shop scheduling problem with bi-criteria
Discrete Applied Mathematics
Scheduling jobs with varying processing times
Information Processing Letters
Parallel machine scheduling with time dependent processing times
Discrete Applied Mathematics
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
Multicriteria Optimization
Single-machine scheduling time-dependent jobs with resource-dependent ready times
Computers and Industrial Engineering
| Hi-index | 0.01 |
In the paper two problems of a single machine bicriterion scheduling of a set of deteriorating jobs are considered. The jobs are independent, nonpreemptable and are ready for processing at time 0. The processing time p"j of each job is a linear function of the starting time S"j of the job, p"j=1+@a"jS"j, where S"j=0 and @a"j0 for j=0,1,...,n. The first problem is to find a schedule which is Pareto optimal with respect to @SC"j and C"m"a"x criteria. The second problem is to find an optimal schedule subject to the minimization of the criterion in the form of @l@SC"j+(1-@l)C"m"a"x, where @l@?[0,1]. There are given necessary and sufficient conditions for a schedule to be Pareto optimal for the first problem. It is proved that there exists 0