Abstract
The worst-case analysis of the approximation algorithm proposed by Palmer and the algorithm RAES (the best of algorithms proposed by Dannenbring) for m -machine permutation flow-shop problem are presented. The worst-case performance ratios equal approximately m 2 for each of the algorithms are found. An evaluation of the worst-case performance ratio of Nawaz's algorithm N is shown. Proposed are a few modifications improving the speed of the algorithms RAES and N.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
