𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Theodore G. Voutsinas; Costas P. Pappis

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
365 KB
Volume
52
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

A branch-and-price algorithm for paralle
A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities
✍ Jonathan F. Bard; Siwate Rojanasoonthon πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 209 KB πŸ‘ 1 views

## Abstract This paper presents a branch‐and‐price algorithm for scheduling __n__ jobs on __m__ nonhomogeneous parallel machines with multiple time windows. An additional feature of the problem is that each job falls into one of __ρ__ priority classes and may require two operations. The objective i

Lower bounds and algorithms for flowtime
Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
✍ Simon Dunstall; Andrew Wirth; Kenneth Baker πŸ“‚ Article πŸ“… 2000 πŸ› Springer US 🌐 English βš– 165 KB πŸ‘ 3 views

We consider the scheduling of N jobs divided into G families for processing on a single machine. No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i = j, the duration of this