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

Minimizing makespan in a two-machine flowshop scheduling with batching and release time

โœ Scribed by Lixin Tang; Peng Liu


Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
721 KB
Volume
49
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Makespan minimization in the two-machine
โœ T.C.E. Cheng; B.M.T. Lin; A. Toker ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 202 KB ๐Ÿ‘ 2 views

In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part-types are to be produced in a flexible manufacturing cell organized into a two-stage production line. The jobs are processed in batches on the first

Minimizing makespan on a single batching
โœ Shuguang Li; Guojun Li; Xiaoli Wang; Qiming Liu ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 214 KB

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.

Minimizing the makespan on a single mach
โœ 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