Total completion time minimization for scheduling of two-machine flow shop with deterioration jobs and setup time
This article studies a scheduling problem of a two-machine flow shop with both time-dependent deteriorating jobs and sequence-independent setup time. It is assumed that the deterioration of processing time and setup time is of a linear increasing function with respect to the starting time. The objec...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SAGE Publishing
2017-04-01
|
| Series: | Advances in Mechanical Engineering |
| Online Access: | https://doi.org/10.1177/1687814017698887 |
| _version_ | 1818117916184281088 |
|---|---|
| author | Ning He Yan Qiao NaiQi Wu Ting Qu |
| author_facet | Ning He Yan Qiao NaiQi Wu Ting Qu |
| author_sort | Ning He |
| collection | DOAJ |
| description | This article studies a scheduling problem of a two-machine flow shop with both time-dependent deteriorating jobs and sequence-independent setup time. It is assumed that the deterioration of processing time and setup time is of a linear increasing function with respect to the starting time. The objective is to minimize the total completion time of all jobs. For such a scheduling problem, a mixed integer programming model is developed to find an optimal solution for small-sized problems. For medium- and large-sized problems, a modified variable neighborhood search algorithm is presented. To improve the performance of the algorithm, a greedy algorithm is proposed to find a good initial solution. Also, lower bounds are presented for performance evaluation. Numerical experiments are used to evaluate the effectiveness and efficiency of the proposed method, and the results show that an optimal or near-optimal solution can be obtained. |
| first_indexed | 2024-12-11T04:46:00Z |
| format | Article |
| id | doaj.art-c105f40a6c814ac68efd293a43010c1b |
| institution | Directory Open Access Journal |
| issn | 1687-8140 |
| language | English |
| last_indexed | 2024-12-11T04:46:00Z |
| publishDate | 2017-04-01 |
| publisher | SAGE Publishing |
| record_format | Article |
| series | Advances in Mechanical Engineering |
| spelling | doaj.art-c105f40a6c814ac68efd293a43010c1b2022-12-22T01:20:31ZengSAGE PublishingAdvances in Mechanical Engineering1687-81402017-04-01910.1177/1687814017698887Total completion time minimization for scheduling of two-machine flow shop with deterioration jobs and setup timeNing He0Yan Qiao1NaiQi Wu2Ting Qu3School of Electro-Mechanical Engineering, Guangdong University of Technology, Guangzhou, ChinaInstitute of Systems Engineering, Macau University of Science and Technology, Macao, ChinaInstitute of Systems Engineering, Macau University of Science and Technology, Macao, ChinaCollege of Electrical and Information Engineering, Jinan University, Zhuhai, ChinaThis article studies a scheduling problem of a two-machine flow shop with both time-dependent deteriorating jobs and sequence-independent setup time. It is assumed that the deterioration of processing time and setup time is of a linear increasing function with respect to the starting time. The objective is to minimize the total completion time of all jobs. For such a scheduling problem, a mixed integer programming model is developed to find an optimal solution for small-sized problems. For medium- and large-sized problems, a modified variable neighborhood search algorithm is presented. To improve the performance of the algorithm, a greedy algorithm is proposed to find a good initial solution. Also, lower bounds are presented for performance evaluation. Numerical experiments are used to evaluate the effectiveness and efficiency of the proposed method, and the results show that an optimal or near-optimal solution can be obtained.https://doi.org/10.1177/1687814017698887 |
| spellingShingle | Ning He Yan Qiao NaiQi Wu Ting Qu Total completion time minimization for scheduling of two-machine flow shop with deterioration jobs and setup time Advances in Mechanical Engineering |
| title | Total completion time minimization for scheduling of two-machine flow shop with deterioration jobs and setup time |
| title_full | Total completion time minimization for scheduling of two-machine flow shop with deterioration jobs and setup time |
| title_fullStr | Total completion time minimization for scheduling of two-machine flow shop with deterioration jobs and setup time |
| title_full_unstemmed | Total completion time minimization for scheduling of two-machine flow shop with deterioration jobs and setup time |
| title_short | Total completion time minimization for scheduling of two-machine flow shop with deterioration jobs and setup time |
| title_sort | total completion time minimization for scheduling of two machine flow shop with deterioration jobs and setup time |
| url | https://doi.org/10.1177/1687814017698887 |
| work_keys_str_mv | AT ninghe totalcompletiontimeminimizationforschedulingoftwomachineflowshopwithdeteriorationjobsandsetuptime AT yanqiao totalcompletiontimeminimizationforschedulingoftwomachineflowshopwithdeteriorationjobsandsetuptime AT naiqiwu totalcompletiontimeminimizationforschedulingoftwomachineflowshopwithdeteriorationjobsandsetuptime AT tingqu totalcompletiontimeminimizationforschedulingoftwomachineflowshopwithdeteriorationjobsandsetuptime |