Some heuristic algorithms for total tardiness minimization in a flowshop with blocking
Authors:
- Débora P. RonconiDRDébora P. Ronconi
- Luís R.S. HenriquesLHLuís R.S. Henriques
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- A note on constructive heuristics for the flowshop problem with blockingInternational Journal of Production Economics, 2004
- Sequencing of jobs in some production systemEuropean Journal of Operational Research, 2000
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in ProcessOperations Research, 1996
- Sequencing of parts and robot moves in a robotic cellInternational Journal of Flexible Manufacturing Systems, 1992
- Flowshop sequencing problems with limited buffer storageInternational Journal of Production Research, 1990
- Minimizing Total Tardiness on One Machine is NP-HardMathematics of Operations Research, 1990
- Sequencing in an Assembly Line with Blocking to Minimize Cycle TimeOperations Research, 1989
- A state-of-art survey of static scheduling research involving due datesOmega, 1984
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega, 1983
- Complexity of Machine Scheduling Problems1977