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


Single-machine group scheduling problems under the effects of deterioration and learning
Authors:Suh-Jenq Yang  Dar-Li Yang
Affiliation:1. Department of Industrial Engineering and Management, Nan Kai University of Technology, Nan-Tou 542, Taiwan;2. Department of Information Management, National Formosa University, Yun-Lin 632, Taiwan;1. Department of Healthcare Management, Yuanpei University, Hsinchu, Taiwan;2. Department of Business Administration, Kang-Ning Junior College, Taipei, Taiwan;3. Department of Statistics and Information Science & Graduate Institute of Applied Statistics, Fu-Jen Catholic University, Taipei County, Taiwan;4. Department of Statistics, Feng Chia University, Taichung, Taiwan;1. School of Management, Xi''an Jiaotong University, Xi''an 710049, China;2. School of Science, Shenyang Aerospace University, Shenyang 110136, China;3. Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China;4. College of Transportation Management, Dalian Maritime University, Dalian 116026, China;5. State Key Laboratory for Manufacturing Systems Engineering, Xi''an Jiaotong University, Xi''an 710053, China;1. School of Management, Xi’an Jiaotong University, Xi’an, Shaanxi Province 710049, PR China;2. State Key Laboratory for Mechanical Manufacturing Systems Engineering, Xi’an Jiaotong University, Xi’an, Shaanxi Province 710049, PR China;3. The Key Lab of the Ministry of Education for Process Control and Efficiency Engineering, Xi’an Jiaotong University, Xi’an, Shaanxi Province 710049, PR China;4. School of Science, Shenyang Aerospace University, Shenyang, Liaoning Province 110136, PR China;1. The Department of Economics and Business Administration, Ariel University, Israel;2. School of Business Administration, The Hebrew University, Jerusalem, Israel
Abstract:This paper investigates single-machine group scheduling problems with simultaneous considerations of deteriorating and learning effects to minimize the makespan and the total completion time of all jobs. The group setup time is assumed to follow a simple linear time-dependent deteriorating model. Two models of learning for the job processing time are examined in this study. We provided polynomial time solutions for the makespan minimization problems. We also showed that the total completion time minimization problems remain polynomially solvable under agreeable conditions.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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