کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1705528 | 1012434 | 2010 | 10 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Mathematical models for job-shop scheduling problems with routing and process plan flexibility Mathematical models for job-shop scheduling problems with routing and process plan flexibility](/preview/png/1705528.png)
As a result of rapid developments in production technologies in recent years, flexible job-shop scheduling problems have become increasingly significant. This paper deals with two NP-hard optimization problems: flexible job-shop scheduling problems (FJSPs) that encompass routing and sequencing sub-problems, and the FJSPs with process plan flexibility (FJSP-PPFs) that additionally include the process plan selection sub-problem. The study is carried out in two steps. In the first step, a mixed-integer linear programming model (MILP-1) is developed for FJSPs and compared to an alternative model in the literature (Model F) in terms of computational efficiency. In the second step, one other mixed-integer linear programming model, a modification of MILP-1, for the FJSP-PPFs is presented along with its computational results on hypothetically generated test problems.
Journal: Applied Mathematical Modelling - Volume 34, Issue 6, June 2010, Pages 1539–1548