《2016 An effective heuristic for flexible job-shop scheduling problem with maintenance activities》.pdf

Computers Industrial Engineering 59 (2010) 436–447 Contents lists available at ScienceDirect Computers Industrial Engineering journal homepage: /locate/caie An effective heuristic for flexible job-shop scheduling problem with maintenance activities q Shijin Wang a,*, Jianbo Yu b a Department of Management Science and Engineering, School of Economics Management, Tongji University, Shanghai 200092, China b College of Mechatronics Engineering and Automation, Shanghai University, Shanghai 200072, China a r t i c l e i n f o a b s t r a c t Article history: Most production scheduling problems, including the standard flexible job-shop scheduling problem Received 12 September 2009 (FJSP), assume that machines are continuously available. However, in most realistic situations, machines Received in revised form 25 February 2010 may become unavailable during certain periods due to preventive maintenance (PM). In this paper, a flex- Accepted 18 May 2010 ible job-shop scheduling problem with machine availability constraints is considered. Each machine is Available online 24 May 2010 subject to preventive maintenance during the planning period and the starting times of maintenance activities are either flexible in a time window or fixed beforehand. Moreover, two cases of maintenance Keywords: resource constraint are considered: sufficient maintenance resource available or only one maintenance Flex