Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
- 15 February 1990
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 44 (3), 331-336
- https://doi.org/10.1016/0377-2217(90)90244-6
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Flowshop and Jobshop Schedules: Complexity and ApproximationOperations Research, 1978
- 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
- Complexity of Machine Scheduling ProblemsPublished by Elsevier BV ,1977
- Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯Journal of the ACM, 1975
- Heuristic-Programming Solution of a Flowshop-Scheduling ProblemOperations Research, 1974
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965