A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem
- 1 June 1996
- journal article
- Published by Springer Science and Business Media LLC in Annals of Operations Research
- Vol. 63 (3), 397-414
- https://doi.org/10.1007/bf02125405
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling ProblemJournal of the Operational Research Society, 1995
- Multiple and bicriteria scheduling: A literature surveyEuropean Journal of Operational Research, 1995
- Two-Stage Flowshop Scheduling Problem with BicriteriaJournal of the Operational Research Society, 1992
- Heuristic Estimation of the Efficient Frontier for a Bi-Criteria Scheduling ProblemDecision Sciences, 1992
- Alternative Formulations of a Flow-shop Scheduling ProblemJournal of the Operational Research Society, 1989
- A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling ProblemJournal of the Operational Research Society, 1986