Minimizing the total weighted completion time of deteriorating jobs

Authors:
Aleksander Bachman;Adam Janiak;Mikhail Y. Kovalyov
Affiliations:
Institute of Engineering Cybernetics, Wroclaw University of Technology, Janiszewskiego 11/17, 50-372 Wroclaw, Poland;Institute of Engineering Cybernetics, Wroclaw University of Technology, Janiszewskiego 11/17, 50-372 Wroclaw, Poland;Institute of Engineering Cybernetics, National Academy of Sciences of Belarus, Surganova 6, 220012 Minsk, Belarus
Venue:
Information Processing Letters
Year:
2002

Citing 4
Cited 20

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
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan

Information Processing Letters
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint

Computers and Operations Research
Scheduling algorithms for procrastinators

Journal of Scheduling
A two-machine flowshop makespan scheduling problem with deteriorating jobs

Computers and Industrial Engineering
Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation

Journal of Scheduling
Single machine parallel-batch scheduling with deteriorating jobs

Theoretical Computer Science
Single machine scheduling with decreasing linear deterioration under precedence constraints

Computers & Mathematics with Applications
Two-machine flow shop problem with effects of deterioration and learning

Computers and Industrial Engineering
Single-machine scheduling problems with deteriorating jobs and learning effects

Computers and Industrial Engineering
Conjugate problems in time-dependent scheduling

Journal of Scheduling
Single-machine scheduling with learning effect and deteriorating jobs

Computers and Industrial Engineering
Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs

Computers and Industrial Engineering
Scheduling deteriorating jobs on a single machine subject to breakdowns

Journal of Scheduling
A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity

Computers and Operations Research
Scheduling to minimize makespan with time-dependent processing times

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A branch and bound algorithm for single machine scheduling with deteriorating values of jobs

Mathematical and Computer Modelling: An International Journal
Scheduling linear deteriorating jobs to minimize the number of tardy jobs

Journal of Global Optimization
A survey on offline scheduling with rejection

Journal of Scheduling
Genetic algorithms for single machine scheduling with time-dependent deterioration and rate-modifying activities

Expert Systems with Applications: An International Journal
Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities

Information Sciences: an International Journal

Quantified Score

Hi-index	0.89

Visualization

Abstract

The paper deals with a single machine problem of scheduling jobs with start time dependent processing times to minimize the total weighted completion time. The computational complexity of this problem was unknown for ten years. We prove that the problem is NP-hard.