Lower bounds for minimizing total completion time in a two-machine flow shop
- 1 December 2006
- journal article
- Published by Springer Nature in Journal of Scheduling
- Vol. 9 (6) , 559-568
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithmEuropean Journal of Operational Research, 2004
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problemEuropean Journal of Operational Research, 2002
- Theory and Methodology A bicriteria approach to the two-machine flow shop scheduling problemEuropean Journal of Operational Research, 1999
- The two-machine total completion time flow shop problemEuropean Journal of Operational Research, 1996
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxationAnnals of Operations Research, 1990
- One-Processor Scheduling with Symmetric Earliness and Tardiness PenaltiesMathematics of Operations Research, 1988
- Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯Journal of the ACM, 1975
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965