A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
- 1 December 2008
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 191 (2), 360-373
- https://doi.org/10.1016/j.ejor.2007.08.030
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Lot splitting to minimize average flow-time in a two-machine flow-shopIIE Transactions, 2002
- An application of genetic algorithms to lot-streaming flow shop schedulingIIE Transactions, 2002
- A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublotsOmega, 2001
- Variable neighborhood search: Principles and applicationsEuropean Journal of Operational Research, 2001
- Genetic algorithms for flowshop scheduling problemsComputers & Industrial Engineering, 1996
- Two- and three-machine flow shop scheduling problems with equal sized transfer batchesInternational Journal of Production Research, 1992
- Optimal and Heuristic Models for Lot Splitting in a Flow ShopDecision Sciences, 1990
- Solution Procedures for the Lot‐Streaming ProblemDecision Sciences, 1990
- Flow shop scheduling with lot streamingOperations Research Letters, 1989
- A System for Managing Job-Shop ProductionThe Journal of Business, 1966