𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient algorithm for scheduling jobs on a machine with periodic maintenance

✍ Scribed by Wen-Jinn Chen

Publisher
Springer
Year
2006
Tongue
English
Weight
183 KB
Volume
34
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A branch and bound algorithm for single
A branch and bound algorithm for single machine scheduling with deteriorating values of jobs
✍ Theodore G. Voutsinas; Costas P. Pappis πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 365 KB

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

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