Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
- 1 December 1990
- journal article
- research article
- Published by Springer Science and Business Media LLC in Annals of Operations Research
- Vol. 26 (1-4), 257-268
- https://doi.org/10.1007/bf03500931
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Openshop and flowshop scheduling to minimize sum of completion timesComputers & Operations Research, 1984
- Algorithms for two-machine flow-shop sequencing with precedence constraintsEuropean Journal of Operational Research, 1984
- Surrogate duality relaxation for job shop schedulingDiscrete Applied Mathematics, 1983
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier BV ,1979
- 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
- Minimizing expected travel time on geometrical patterns by optimal probability rearrangementsInformation and Control, 1972
- Optimality Criteria for Flowshop SchedulesA I I E Transactions, 1971
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954