Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2005.03552 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913433293684736 |
|---|---|
| author | Hertrich, Christoph Weiß, Christian Ackermann, Heiner Heydrich, Sandy Krumke, Sven O. |
| author_facet | Hertrich, Christoph Weiß, Christian Ackermann, Heiner Heydrich, Sandy Krumke, Sven O. |
| contents | This paper is the first to consider online algorithms to schedule a proportionate flexible flow shop of batching machines (PFFB). The scheduling model is motivated by manufacturing processes of individualized medicaments, which are used in modern medicine to treat some serious illnesses. We provide two different online algorithms, proving also lower bounds for the offline problem to compute their competitive ratios. The first algorithm is an easy-to-implement, general local scheduling heuristic. It is 2-competitive for PFFBs with an arbitrary number of stages and for several natural scheduling objectives. We also show that for total/average flow time, no deterministic algorithm with better competitive ratio exists. For the special case with two stages and the makespan or total completion time objective, we describe an improved algorithm that achieves the best possible competitive ratio $φ=\frac{1+\sqrt{5}}{2}$, the golden ratio. All our results also hold for proportionate (non-flexible) flow shops of batching machines (PFB) for which this is also the first paper to study online algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2005_03552 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines Hertrich, Christoph Weiß, Christian Ackermann, Heiner Heydrich, Sandy Krumke, Sven O. Data Structures and Algorithms This paper is the first to consider online algorithms to schedule a proportionate flexible flow shop of batching machines (PFFB). The scheduling model is motivated by manufacturing processes of individualized medicaments, which are used in modern medicine to treat some serious illnesses. We provide two different online algorithms, proving also lower bounds for the offline problem to compute their competitive ratios. The first algorithm is an easy-to-implement, general local scheduling heuristic. It is 2-competitive for PFFBs with an arbitrary number of stages and for several natural scheduling objectives. We also show that for total/average flow time, no deterministic algorithm with better competitive ratio exists. For the special case with two stages and the makespan or total completion time objective, we describe an improved algorithm that achieves the best possible competitive ratio $φ=\frac{1+\sqrt{5}}{2}$, the golden ratio. All our results also hold for proportionate (non-flexible) flow shops of batching machines (PFB) for which this is also the first paper to study online algorithms. |
| title | Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2005.03552 |