𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Notes on Max Flow Time Minimization with Controllable Processing Times

✍ Scribed by Monaldo Mastrolilli

Book ID
106202501
Publisher
Springer Vienna
Year
2003
Tongue
English
Weight
386 KB
Volume
71
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Proportionate flow shop with controllabl
Proportionate flow shop with controllable processing times
✍ T. C. Edwin Cheng; Natalia Shakhlevich πŸ“‚ Article πŸ“… 1999 πŸ› Springer US 🌐 English βš– 122 KB

This paper considers a special class of ow-shop problems, known as the proportionate ow shop. In such a shop, each job ows through the machines in the same order and has equal processing times on the machines. The processing times of di erent jobs may be di erent. It is assumed that all operations o

On-line scheduling to minimize max flow
On-line scheduling to minimize max flow time: an optimal preemptive algorithm
✍ Christoph AmbΓΌhl; Monaldo Mastrolilli πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 170 KB

We investigate the maximum flow time minimization problem of on-line scheduling jobs on m identical parallel machines. When preemption is allowed, we derive an optimal algorithm with competitive ratio 2 -1/m. When preemption is not allowed and m = 2, we show that the First In First Out heuristic ach