Journal of the Operations Research Society of China >
On Two-machine Flow Shop Scheduling
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.
Key words： Flow shop ; Linear time; Online algorithm
Lin Chen · Wen-Chang Luo · Guo-Chuan Zhang . On Two-machine Flow Shop Scheduling[J]. Journal of the Operations Research Society of China, 2014 , 2(3) : 333 -340 . DOI: 10.1007/s40305-014-0055-x
/
| 〈 |
|
〉 |
