《2013 Evaluation of mathematical models for flexible job-shop scheduling problems》.pdfVIP

Applied Mathematical Modelling 37 (2013) 977–988 Contents lists available at SciVerse ScienceDirect Applied Mathematical Modelling journal homepage: www.else /locate/apm Evaluation of mathematical models for flexible job-shop scheduling problems ⇑ _ Yunus Demir , S. Kürsat Isleyen Faculty of Engineering, Department of Industrial Engineering, Atatürk University, 25240 Erzurum, Turkey a r t i c l e i n f o a b s t r a c t Article history: With the rapid development in computer technologies, mathematical programming-based Received 16 August 2011 technique to solve scheduling problems is significantly receiving attention from research- Received in revised form 7 March 2012 ers. Although, it is not efficient solution method due to the NP-hard structure of these prob- Accepted 12 March 2012 lems, mathematical programming formulation is the first step to develop an effective Available online 21 March 2012 heuristic. Numerous comparative studies for variety scheduling problems have appeared over the years. But in our search in literature there is not an entirely review for mathemat- Keywords: ical formulations of flexible job shop scheduling problems (FJSP). In this paper, four the Flexible job-shops most widely used formulations of the FJSP are compiled from literature and a time-indexe