Bibliographic Details
| Title: |
Job shop scheduling with the option of jobs outsourcing. |
| Authors: |
Safarzadeh, Hamid1, Kianfar, Farhad1 fkianfar@sharif.edu |
| Source: |
International Journal of Production Research. May2019, Vol. 57 Issue 10, p3255-3272. 18p. 3 Charts, 3 Graphs. |
| Subject Terms: |
*Production scheduling, *Mathematical programming, *Warehouses, *Contracting out, *Job shops, Constraint programming, Combinatorial optimization |
| Abstract: |
Incorporating outsourcing in scheduling is addressed by several researchers recently. However, this scope is not investigated thoroughly, particularly in the job shop environment. In this paper, a new job shop scheduling problem is studied with the option of jobs outsourcing. The problem objective is to minimise a weighted sum of makespan and total outsourcing cost. With the aim of solving this problem optimally, two solution approaches of combinatorial optimisation problems, i.e. mathematical programming and constraint programming are examined. Furthermore, two problem relaxation approaches are developed to obtain strong lower bounds for some large scale problems for which the optimality is not proven by the applied solution techniques. Using extensive numerical experiments, the performance of the solution approaches is evaluated. Moreover, the effect the objectives's weights in the objective function on the performance of the solution approaches is also investigated. It is concluded that constraint programming outperforms mathematical programming significantly in proving solution optimality, as it can solve small and medium size problems optimally. Moreover, by solving the relaxed problems, one can obtain good lower bounds for optimal solutions even in some large scale problems. [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Business Source Complete |
|
Full text is not displayed to guests. |
Login for full access.
|
