The two-machine total completion time flow shop problem
- 19 April 1996
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 90 (2), 227-237
- https://doi.org/10.1016/0377-2217(95)00351-7
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Minimizing Mean Flow Time in Two-Machine Open Shops and Flow ShopsJournal of Algorithms, 1993
- A branch-and-bound algorithm to minimize total tardiness with different release datesNaval Research Logistics (NRL), 1992
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxationAnnals of Operations Research, 1990
- 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 auction algorithm: A distributed relaxation method for the assignment problemAnnals of Operations Research, 1988
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier BV ,1979
- 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
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman ProblemOperations Research, 1964
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954