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

Minimizing makespan on a single batching machine with release times and non-identical job sizes

โœ Scribed by Shuguang Li; Guojun Li; Xiaoli Wang; Qiming Liu

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

No coin nor oath required. For personal study only.

โœฆ Synopsis

We consider the problem of scheduling jobs with release times and non-identical job sizes on a single batching machine; our objective is to minimize makespan. We present an approximation algorithm with worst-case ratio 2 + , where ยฟ 0 can be made arbitrarily small.

๐Ÿ“œ SIMILAR VOLUMES

Minimizing the makespan on a single mach
Minimizing the makespan on a single machine with learning and unequal release times
โœ Chin-Chia Wu; Chin-Liang Liu ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 202 KB

The importance of the ready times can be found in Wafer fabrication with the presence of unequal ready times. It is sometimes advantageous to form a non-full batch, while in other situations it is a better strategy to wait for future job arrivals in order to increase the fullness of the batch. On th