The permutation flow shop problem with sum-of-completion times performance criterion
- 1 October 1993
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 40 (6), 843-862
- https://doi.org/10.1002/1520-6750(199310)40:6<843::aid-nav3220400608>3.0.co;2-a
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shopEuropean Journal of Operational Research, 1990
- The Flow-Shop Problem with Mean Completion Time CriterionIIE Transactions, 1983
- Permutation flow‐shop theory revisitedNaval Research Logistics Quarterly, 1978
- Flowshop and Jobshop Schedules: Complexity and ApproximationOperations Research, 1978
- On convergence rates of subgradient optimization methodsMathematical Programming, 1977
- Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound ApproachA I I E Transactions, 1977
- An ordered flow-shop sequencing problem with mean completion time criterion†International Journal of Production Research, 1976
- A Comparative Study of Flow-Shop AlgorithmsOperations Research, 1975
- 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