Abstract
In this note, we revisit the classical two-machine flow shop scheduling problem. A linear time approximation scheme is presented. For an online version with rejection, we propose best possible online algorithms.
Original language | English |
---|---|
Pages (from-to) | 333-339 |
Number of pages | 7 |
Journal | Journal of the Operations Research Society of China |
Volume | 2 |
Issue number | 3 |
DOIs | |
State | Published - Sep 1 2014 |
Keywords
- Flow shop
- Linear time
- Online algorithm