An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- 1 November 1997
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 103 (1) , 129-138
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Flowshop sequencing with mean flowtime objectiveEuropean Journal of Operational Research, 1995
- Modified simulated annealing algorithms for the flow shop sequencing problemEuropean Journal of Operational Research, 1995
- An extension of Palmer's heuristic for the flow shop scheduling problemInternational Journal of Production Research, 1988
- Heuristics for flow-shop schedulingInternational Journal of Production Research, 1980
- Four simple heuristics for scheduling a flow-shopInternational Journal of Production Research, 1978
- An Evaluation of Flow Shop Sequencing HeuristicsManagement Science, 1977
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- A Heuristic Algorithm for the n Job, m Machine Sequencing ProblemManagement Science, 1970
- 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