首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A combined robot selection and scheduling problem for flow-shops with no-wait restrictions
Institution:1. School of Computer and Information Technology, Beijing Jiaotong University, China;2. School of Information Science and Technology, Sun Yat-sen University, China;3. School of Computer Science, University of Adelaide, Australia;4. School of Electronics and Information Engineering, Beijing Jiaotong University, China
Abstract:
Keywords:Scheduling  Flow-shop  No-wait restriction  Robotic flow-shop  Makespan  Bicriteria shortest path problem
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号