On lower bounds in permutation flow shop problems
- 1 July 1979
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 17 (4) , 411-418
- https://doi.org/10.1080/00207547908919624
Abstract
This paper presents an algorithm for finding an improved machine-based lower bound of make-span by introducing the concept of maximum effective preprocessing time for a machine. The usefulness is indicated by developing machino-based lower bounds without presequence of jobs. Numerical examples illustrate the improvement in the value of machine-based bound which in turn improves the global lower bound for permutation flows hop problems only.Keywords
This publication has 4 references indexed in Scilit:
- A New Bound for Machine SchedulingJournal of the Operational Research Society, 1976
- 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
- A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling ProblemJournal of the Operational Research Society, 1965