A branch and bound algorithm for single machine scheduling with deteriorating values of jobs

Authors:
Theodore G. Voutsinas;Costas P. Pappis
Affiliations:
University of Piraeus, Department of Industrial Management, 80 Karaoli & Dimitriou street, 185 34-Piraeus, Hellas, Greece;University of Piraeus, Department of Industrial Management, 80 Karaoli & Dimitriou street, 185 34-Piraeus, Hellas, Greece
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2010

Citing 8
Cited 0

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
Three scheduling problems with deteriorating jobs to minimize the total completion time

Information Processing Letters
Minimizing the total weighted completion time of deteriorating jobs

Information Processing Letters
Single processor scheduling with job values depending on their completion times

Journal of Scheduling
Job Sequencing with Exponential Functions of Processing Times

Informatica
Batching work and rework processes with limited deterioration of reworkables

Computers and Operations Research

Quantified Score

Hi-index	0.98

Visualization

Abstract

Scheduling deteriorating jobs is an area of research which has attracted much attention recently. In this paper the problem of single machine scheduling, where the values of jobs remaining after processing deteriorate over time, is presented. A branch and bound method is developed, which, using the sub-optimal solution of a heuristic algorithm as an initial solution, leads to the optimal solution of the problem. The method is applied in a case of remanufacturing of PCs and is evaluated by comparing the results (in terms of computer time needed for the application) to those of complete enumeration.