Heuristics for the flow line problem with setup costs
- 1 October 1998
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 110 (1) , 76-98
- https://doi.org/10.1016/s0377-2217(97)00213-0
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problemPublished by Elsevier ,2003
- Two branch and bound algorithms for the permutation flow shop problemEuropean Journal of Operational Research, 1996
- A GRASP for the Vehicle Routing Problem with Time WindowsINFORMS Journal on Computing, 1995
- Scheduling heuristic for the n-jobm-machine flow shopOmega, 1993
- Heuristics in flow shop scheduling with sequence dependent setup timesOmega, 1992
- A search heuristic for just-in-time scheduling in parallel machinesJournal of Intelligent Manufacturing, 1991
- Flight Scheduling and Maintenance Base PlanningManagement Science, 1989
- A new heuristic method for the flow shop sequencing problemEuropean Journal of Operational Research, 1989
- A probabilistic heuristic for a computationally difficult set covering problemOperations Research Letters, 1989
- An adaptive branching rule for the permutation flow-shop problemEuropean Journal of Operational Research, 1980