Open Access
| Issue |
Manufacturing Rev.
Volume 1, 2014
|
|
|---|---|---|
| Article Number | 21 | |
| Number of page(s) | 10 | |
| DOI | https://doi.org/10.1051/mfreview/2014020 | |
| Published online | 18 December 2014 | |
- V. Botta-Genoulaz, Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness, International Journal of Production Economics 64 (2000) 101–111. [CrossRef] [Google Scholar]
- P. Caricato, A. Grieco, D. Serino, Tsp-based scheduling in a batch-wise hybrid flow-shop, Robotics and Computer-Integrated Manufacturing 23 (2007) 234–241. [CrossRef] [Google Scholar]
- P. Fattahi, M. Saidi, F. Jolai, Mathematical modeling and heuristic approaches to flexible job shop scheduling problems, Journal of Intelligent Manufacturing 18 (2007) 331–342. [CrossRef] [Google Scholar]
- J. Fondrevelle, A. Oulamara, M.-C. Portmann, Permutation flow shop scheduling problems with maximal and minimal time lags, Computers & Operations Research 33 (2006) 1540–1556. [CrossRef] [MathSciNet] [Google Scholar]
- D.E. Goldberg, Genetic algorithms in search optimization and machine learning, Addison-Wesley, Reading, MA, 1989. [Google Scholar]
- J.H. Holland, Adaptation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, 1975. [Google Scholar]
- T.S.L. Hung, J.L. Ching, A case study in a two-stage hybrid flow shop with setup time and dedicated machines, International Journal of Production Economics 86 (2003) 133–143. [CrossRef] [Google Scholar]
- N. Javadian, P. Fattahi, M. Farahmand-Mehr, M. Amiri-Aref, M. Kazemi, An immune algorithm for hybrid flow shop scheduling problem with time lags and sequence dependent setup times, International Journal of Advanced Manufacturing Technology 63 (2012) 337–348. [CrossRef] [Google Scholar]
- M.E. Kurz, R.G. Askin, Comparing scheduling rules for flexible flow lines, International Journal of Production Economics 85 (2003) 371–388. [CrossRef] [Google Scholar]
- M.E. Kurz, R.G. Askin, Scheduling flexible flow lines with sequence-dependent setup times, European Journal of Operational Research 159 (2004) 66–82. [CrossRef] [MathSciNet] [Google Scholar]
- R. Logendran, P. de Szoeke, F. Barnard, Sequence dependent group scheduling problems in flexible flow shops, International Journal of Production Economics 102 (2006) 66–86. [CrossRef] [Google Scholar]
- B.A. Norman, J.C. Bean, A genetic algorithm methodology for complex scheduling problems, Naval Research Logistics 46 (1999) 199–211. [CrossRef] [MathSciNet] [Google Scholar]
- D. Palmer, Sequencing jobs through a multi-stage process in the minimum total time a quick method of obtaining a near optimum, Operational Research Quarterly 16 (1965) 101–107. [CrossRef] [Google Scholar]
- R.Z. Rios-Mercado, J.F. Bard, Computational experience with a branch-and-cut algorithm for flow shop scheduling with setups, Computers and Operations Research 25 (1998) 351–366. [CrossRef] [Google Scholar]
- R. Ruiz, C. Maroto, A genetic algorithm for hybrid flow shops with sequence dependent setup times and machine eligibility, European Journal of Operational Research 169 (2006) 781–800. [CrossRef] [MathSciNet] [Google Scholar]
- R. Ruiz, C. Maroto, J. Alcaraz, Solving the flow shop scheduling problem with sequence dependent setup times using advanced metaheuristics, European Journal of Operational Research 165 (2005) 34–54. [CrossRef] [MathSciNet] [Google Scholar]
- M. Zandieh, S.M.T. FatemiGhomi, S.M. MoattarHusseini, An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, Applied Mathematics and Computation 180 (2006) 111–127. [CrossRef] [MathSciNet] [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.