Flowshop sequencing with mean flowtime objective
- 16 March 1995
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 81 (3), 571-578
- https://doi.org/10.1016/0377-2217(93)e0353-y
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- A new heuristic for the n-job, M-machine flow-shop problemEuropean Journal of Operational Research, 1991
- 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
- An extension of Palmer's heuristic for the flow shop scheduling problemInternational Journal of Production Research, 1988
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion timesNaval Research Logistics Quarterly, 1982
- 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
- An Evaluation of Flow Shop Sequencing HeuristicsManagement Science, 1977
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- Heuristic Algorithms for Multistage Flowshop Scheduling ProblemA I I E Transactions, 1972
- 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