An approximation algorithm for the m-machine permutation flow shop scheduling problem with controllable processing times

1993 ◽  
Vol 70 (3) ◽  
pp. 342-349 ◽  
Author(s):  
Eugeniusz Nowicki
Sign in / Sign up

Export Citation Format

Share Document