Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Elimination conditions and lower bounds for the permutation flow-shop sequencing problem

Elimination conditions and lower bounds for the permutation flow-shop sequencing problem We give some new elimination conditions for permutation flow-shop problem and prove that there is one among them equivalent to Szwarc's elimination condition. Next we propose some new lower bounds for a branch-and-bound method and design an algorithm. Computational results indicate that the proposed algorithm is more efficient than those we found in literature. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

Elimination conditions and lower bounds for the permutation flow-shop sequencing problem

Loading next page...
 
/lp/springer-journals/elimination-conditions-and-lower-bounds-for-the-permutation-flow-shop-EENT58aqSj
Publisher
Springer Journals
Copyright
Copyright © 1985 by Science Press and D. Reidel Publishing Company
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/BF01665847
Publisher site
See Article on Publisher Site

Abstract

We give some new elimination conditions for permutation flow-shop problem and prove that there is one among them equivalent to Szwarc's elimination condition. Next we propose some new lower bounds for a branch-and-bound method and design an algorithm. Computational results indicate that the proposed algorithm is more efficient than those we found in literature.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Apr 25, 2005

References