Deterministic and random single machine sequencing with variance minimization
Operations Research
Optimal common due-data with limited completion time deviation
Computers and Operations Research
Single facility scheduling with nonlinear processing times
Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor
Operations Research
Scheduling jobs under simple linear deterioration
Computers and Operations Research
Scheduling jobs under decreasing linear deterioration
Information Processing Letters
Total absolute deviation of job completion times on uniform and unrelated machines
Computers and Operations Research
Single-machine makespan minimization scheduling with nonlinear shortening processing times
Computers and Operations Research
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.01 |
We consider a single machine scheduling problem with simple linear deterioration. Job processing times are assumed to be a simple linear function of a job-dependent growth rate and the job's starting time. We seek an optimal schedule, so as to minimize the total absolute deviation of completion times (TADC). We prove several interesting properties of an optimal schedule, and introduce two efficient heuristics which are tested against a lower bound. Scope and purpose: In most scheduling problems jobs are assumed to have time-independent processing times. In many real life applications, jobs deteriorate at a certain rate while waiting to be processed. We study the effect of job deterioration when addressing a scheduling problem with the non-regular objective function of minimizing the total deviation of completion times. This objective can be regarded as a measure of ''fairness'' towards customers of the production system.