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.
|Number of pages||7|
|Journal||Journal of the Operations Research Society of China|
|State||Published - Sep 1 2014|
- Flow shop
- Linear time
- Online algorithm