Effective overhead hoist transport dispatching based on the Hungarian algorithm for a large semiconductor FAB

DOI10.1080/00207540701491090zbMath1163.90368OpenAlexW1990697789MaRDI QIDQ3636769

Sangwon Jeong, Jaejoon Shin, Byung-In Kim, Jeongin Koo

Publication date: 29 June 2009

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540701491090

zbMATH Keywords

assignment problemreassignmentautomated guided vehicledispatching ruleoverhead hoist transport

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cites Work

• Scheduling and routing of automated guided vehicles: A hybrid approach
• Design and operational issues in AGV-served manufacturing systems
• Survey of research in the design and control of automated guided vehicle systems
• A review of design and control of automated guided vehicle systems
• An AGV routing policy reflecting the current and future state of semiconductor and LCD production lines
• A multi-attribute dispatching rule for automated guided vehicle systems
• Effectiveness of vehicle reassignment in a large-scale overhead hoist transport system

This page was built for publication: Effective overhead hoist transport dispatching based on the Hungarian algorithm for a large semiconductor FAB