๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The complexity of machine scheduling for stability with a single disrupted job

โœ Scribed by Roel Leus; Willy Herroelen

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
200 KB
Volume
33
Category
Article
ISSN
0167-6377

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