Non-permutation flow shop scheduling problem with preemption-dependent processing time
In this paper, the non-permutation flow shop scheduling problem with preemption-dependent processing times is considered. A mixed integer programming formulation is proposed to tackle the problem. The optimization objective considered is the minimization of the total tardiness. The model is tested a...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2016-12-01
|
| Series: | Cogent Engineering |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1080/23311916.2016.1243982 |
| _version_ | 1797764602747944960 |
|---|---|
| author | Mohsen Ziaee Hossein Karimi |
| author_facet | Mohsen Ziaee Hossein Karimi |
| author_sort | Mohsen Ziaee |
| collection | DOAJ |
| description | In this paper, the non-permutation flow shop scheduling problem with preemption-dependent processing times is considered. A mixed integer programming formulation is proposed to tackle the problem. The optimization objective considered is the minimization of the total tardiness. The model is tested against random instances. The results allow us to identify the effect of some parameters such as coefficient of preemption-dependent processing time, number of preemptions and the selected machine for preemption on the total tardiness. |
| first_indexed | 2024-03-12T19:58:09Z |
| format | Article |
| id | doaj.art-a637754c8798453582d50d612f0a1c60 |
| institution | Directory Open Access Journal |
| issn | 2331-1916 |
| language | English |
| last_indexed | 2024-03-12T19:58:09Z |
| publishDate | 2016-12-01 |
| publisher | Taylor & Francis Group |
| record_format | Article |
| series | Cogent Engineering |
| spelling | doaj.art-a637754c8798453582d50d612f0a1c602023-08-02T02:40:33ZengTaylor & Francis GroupCogent Engineering2331-19162016-12-013110.1080/23311916.2016.12439821243982Non-permutation flow shop scheduling problem with preemption-dependent processing timeMohsen Ziaee0Hossein Karimi1University of BojnordUniversity of BojnordIn this paper, the non-permutation flow shop scheduling problem with preemption-dependent processing times is considered. A mixed integer programming formulation is proposed to tackle the problem. The optimization objective considered is the minimization of the total tardiness. The model is tested against random instances. The results allow us to identify the effect of some parameters such as coefficient of preemption-dependent processing time, number of preemptions and the selected machine for preemption on the total tardiness.http://dx.doi.org/10.1080/23311916.2016.1243982preemptionflow shopscheduling |
| spellingShingle | Mohsen Ziaee Hossein Karimi Non-permutation flow shop scheduling problem with preemption-dependent processing time Cogent Engineering preemption flow shop scheduling |
| title | Non-permutation flow shop scheduling problem with preemption-dependent processing time |
| title_full | Non-permutation flow shop scheduling problem with preemption-dependent processing time |
| title_fullStr | Non-permutation flow shop scheduling problem with preemption-dependent processing time |
| title_full_unstemmed | Non-permutation flow shop scheduling problem with preemption-dependent processing time |
| title_short | Non-permutation flow shop scheduling problem with preemption-dependent processing time |
| title_sort | non permutation flow shop scheduling problem with preemption dependent processing time |
| topic | preemption flow shop scheduling |
| url | http://dx.doi.org/10.1080/23311916.2016.1243982 |
| work_keys_str_mv | AT mohsenziaee nonpermutationflowshopschedulingproblemwithpreemptiondependentprocessingtime AT hosseinkarimi nonpermutationflowshopschedulingproblemwithpreemptiondependentprocessingtime |