A new integer programming formulation for the permutation flowshop problem
- 5 May 1989
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 40 (1) , 90-98
- https://doi.org/10.1016/0377-2217(89)90276-2
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier ,1979
- A New Bound for Machine SchedulingJournal of the Operational Research Society, 1976
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- A Comparative Study of Flow-Shop AlgorithmsOperations Research, 1975
- Lagrangean relaxation for integer programmingPublished by Springer Nature ,1974
- A Heuristic Algorithm for the n Job, m Machine Sequencing ProblemManagement Science, 1970
- Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling ProblemJournal of the Operational Research Society, 1966
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965
- Approximate Solutions to the Three-Machine Scheduling ProblemOperations Research, 1964