296
Views
5
CrossRef citations to date
0
Altmetric
Articles

A hybrid scheduling approach for automated flowshops with material handling and time constraints

, &
Pages 2788-2806 | Received 17 Dec 2012, Accepted 15 Jan 2014, Published online: 24 Feb 2014

References

  • Aguirre, A., V. Cafaro, C. Mendez, P. Castro. (2011). “An Optimization and Simulation Approach for Industrial-scale Scheduling Problems in Semiconductor Manufacturing Systems.” Proceedings of European Modelling & Simulation Symposium EMSS2011 (Simulation in Industry), Rome, Italy, 384–393.
  • Aguirre, A. M., C. A. Méndez, and P. M. Castro. 2011. “A Novel Optimization Method to Automated Wet-etch Station Scheduling in Semiconductor Manufacturing Systems.” Computers & Chemical Engineering 35 (12): 2960–2972.
  • Bhushan, S., and I. A. Karimi. 2003. “An MILP Approach to Automated Wet-etch Station Scheduling.” Industrial & Engineering Chemistry Research 42 (7): 1391–1399.
  • Bhushan, S., and I. A. Karimi. 2004. “Heuristic Algorithms for Scheduling an Automated Wet-etch Station.” Computers & Chemical Engineering 28 (3): 363–379.
  • Castro, P. M., A. M. Aguirre, L. J. Zeballos, and C. A. Méndez. 2011. “Hybrid Mathematical Programming Discrete-event Simulation Approach for Large-scale Scheduling Problems.” Industrial & Engineering Chemistry Research 50: 10665–10680.
  • Castro, P. M., I. Harjunkoski, and I. E. Grossmann. 2009. “Optimal Short-term Scheduling of Large-scale Multistage Batch Plants.” Industrial & Engineering Chemistry Research 48: 11002–11016.
  • Castro, P. M., L. J. Zeballos, and C. A. Méndez. 2012. “Hybrid Time Slots Sequencing Model for a Class of Scheduling Problems.” AIChE Journal 58 (3): 789–800.
  • Cortés, B. M., J. C. E. García, and F. R. Hernández. 2012. “Multi-objective Flow-shop Scheduling with Parallel Machines.” International Journal of Production Research 50 (10): 2796–2808.
  • Crama, Y. 1997. “Combinatorial Optimization Models for Production Scheduling in Automated Manufacturing Systems.” European Journal of Operational Research 99 (1): 136–153.
  • Engell, S., and I. Harjunkoski. 2012. “Optimal Operation: Scheduling, Advanced Control and their Integration.” Computers & Chemical Engineering 47: 121–133.
  • Fu, Q., A. I. Sivakumar, and K. Li. 2012. “Optimisation of Flow-shop Scheduling with Batch Processor and Limited Buffer.” International Journal of Production Research 50 (8): 2267–2285.
  • Geiger, C. E., K. G. Kempf, and R. Uzsoy. 1997. “A Tabu Search Approach to Scheduling an Automated Wet Etch Station.” Journal of Manufacturing Systems 16 (2): 102–116.
  • Gupta, J. N. E., R. Ruiz, J. W. Fowler, and S. J. Mason. 2006. “Operational Planning and Control of Semiconductor Wafer Production.” Production Planning & Control 17 (7): 639–647.
  • Gupta, J. N. E., and E. F. Stafford Jr.. 2006. “Flowshop Scheduling Research After Five Decades.” European Journal of Operational Research 169 (3): 699–711.
  • Ham, M. 2012. “Integer Programming-based Real-time Dispatching (I-RTD) Heuristic for Wet-etch Station at Wafer Fabrication.” International Journal of Production Research 50 (10): 2809–2822.
  • Jin, F., S. Song, and C. Wu. 2007. “An Improved Version of the NEH Algorithm and its Application to Large-scale Flow-shop Scheduling Problems.” IIE Transactions 39 (2): 229–234.
  • Kim, Hyun-Jung, Jun-Ho Lee, and Tae-Eog Lee. 2012. “Scheduling a Wet Station Using a Branch and Bound Algorithm.” IEEE Conference on Systems, Man, and Cybernetics, 2097–2102. Seoul, Korea.
  • Kim, H.-J., J.-H. Lee, and T.-E. Lee. 2013. “Non-cyclic Scheduling of a Wet Station.” IEEE Transactions on Automation Science and Engineering PP (99): 1–13.
  • Kopanos, G. M., C. A. Méndez, and L. Puigjaner. 2010. “MIP-based Decomposition Strategies for Large-scale Scheduling Problems in Multiproduct Multistage Batch Plants: A Benchmark Scheduling Problem of the Pharmaceutical Industry.” European Journal of Operational Research 207: 644–655.
  • Ku, H., and I. A. Karimi. 1990. “Completion Time Algorithms for Serial Multiproduct Batch Processes with Shared Storage.” Computers & Chemical Engineering 14: 49–69.
  • Lee, T.-E., H.-Y. Lee, and S.-J. Lee. 2007. “Scheduling a Wet Station for Wafer Cleaning with Multiple Job Flows and Multiple Wafer-handling Robots.” International Journal of Production Research 45 (3): 487–507.
  • Méndez, C. A., and J. Cerdá. 2002. “An MILP Framework for Short-term Scheduling of Single-stage Batch Plants with Limited Discrete Resources.” Computer-Aided Chemical Engineering 12: 721–726.
  • Méndez, C. A., and J. Cerdá. 2003. “An MILP Continuous-time Framework for Short-term Scheduling of Multipurpose Batch Processes under Different Operation Strategies.” Optimization and Engineering 4: 7–22.
  • Méndez, C. A., and J. Cerdá. 2004. “Short-term Scheduling of Multistage Batch Processes Subject to Limited Finite Resources.” Computer-Aided Chemical Engineering 15B: 984–989.
  • Méndez, C. A., J. Cerdá, I. Harjunkoski, I. E. Grossmann, and M. Fahl. 2006. “State-of-the-art Review of Optimization Methods for Short-term Scheduling of Batch Processes.” Computers and Chemical Engineering 30 (6): 913–946.
  • Nawaz, M., E. E. Enscore Jr., and I. And Ham. 1983. “A Heuristic Algorithm for the M-machine, N-job Flow-shop Sequencing Problem.” Omega 11: 65–74.
  • Noorul Haq, A., T. R. Ramanan, K. S. Shashikant, and R. Sridharan. 2010. “A Hybrid Neural Network-genetic Algorithm Approach for Permutation Flow Shop Scheduling.” International Journal of Production Research 48 (14): 4217–4231.
  • Phillips, L. W., and P. S. Unger. 1976. “Mathematical Programming Solution of a Hoist Scheduling Program.” AIIE Transactions 28 (2): 219–225.
  • Pinedo, M. 2002. Scheduling: Theory, Algorithms, and Systems. 2nd ed. Upper Saddle River, NJ:Prentice Hall.
  • Ribas, I., R. Companys, and X. Tort-Martorell. 2013. An Efficient Iterated Local Search Algorithm for the Total Tardiness Blocking Flow Shop Problem. International Journal of Production Research 51 (17): 5238–5252.
  • Rossi, A., A. Pandolfi, and M. Lanzetta. 2013. Dynamic Set-up Rules for Hybrid Flow Shop Scheduling with Parallel Batching Machines. International Journal of Production Research, doi:10.1080/00207543.2013.835496.
  • Ruiz, R., and C. A. Maroto. 2005. “A Comprehensive Review and Evaluation of Permutation Flowshop Heuristics.” European Journal of Operational Research 165: 479–494.
  • Seidgar, H., M. Kiani, M. Abedi, and H. Fazlollahtabar. (2014). “An Efficient Imperialist Competitive Algorithm for Scheduling in the Two-stage Assembly Flow Shop Problem.” International Journal of Production Research 52 (4): 1240–1256.
  • Shapiro, G. W., and H. L. Nuttle. 1988. “Hoist Scheduling for a PCB Electroplating Facility.” IIE Transactions 20 (2): 157–167.
  • Uzsoy, R., C. Y. Lee, and L. A. Martin-Vega. 1992. “A Review of Production Planning and Scheduling Models in the Semiconductor Industry Part I: System Characteristics, Performance Evaluation and Production Planning.” IEEE Transaction on Scheduling and Logistic 24: 47–60.
  • Wang. S., and M. Liu. (2013). Two-stage Hybrid Flow Shop Scheduling with Preventive Maintenance Using Multi-objective Tabu Search Method. International Journal of Production Research, doi:10.1080/00207543.2013.847983.
  • Wu, W., J. Wei, X. Guan, and L. Shi. 2012. “A Hybrid Nested Partitions Algorithm for Scheduling Flexible Resource in Flow Shop Problem.” International Journal of Production Research 50 (10): 2555–2569.
  • Yin, Y. 1994. “An Algorithm for Hoist Scheduling Problems.” International Journal of Production Research 32 (3): 501–516.
  • Zeballos, L. J., P. M. Castro, and C. A. Méndez. 2011. “An Integrated Constraint Programming Scheduling Approach for Automated Wet-etch Stations in Semiconductor Manufacturing.” Industrial & Engineering Chemistry Research 50: 1705–1715.
  • Zhou, Z., and J. Liu. 2008. “A Heuristic Algorithm for the Two-hoist Cyclic Scheduling Problem with Overlapping Hoist Coverage Ranges.” IIE Transactions 40 (8): 782–794.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.