Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents
We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-and-bound algorithm is developed to derive th...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/596306 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832555436770852864 |
|---|---|
| author | Wen-Chiung Lee Yau-Ren Shiau Yu-Hsiang Chung Lawson Ding |
| author_facet | Wen-Chiung Lee Yau-Ren Shiau Yu-Hsiang Chung Lawson Ding |
| author_sort | Wen-Chiung Lee |
| collection | DOAJ |
| description | We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-and-bound algorithm is developed to derive the optimal sequence and two simulated annealing heuristic algorithms are proposed to search for the near-optimal solutions. Computational experiments are also conducted to evaluate the proposed branch-and-bound and simulated annealing algorithms. |
| format | Article |
| id | doaj-art-dfd62d77d3cf44679b5efe6890e00456 |
| institution | Kabale University |
| issn | 2356-6140 1537-744X |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | The Scientific World Journal |
| spelling | doaj-art-dfd62d77d3cf44679b5efe6890e004562025-02-03T05:48:17ZengWileyThe Scientific World Journal2356-61401537-744X2014-01-01201410.1155/2014/596306596306Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing AgentsWen-Chiung Lee0Yau-Ren Shiau1Yu-Hsiang Chung2Lawson Ding3Department of Statistics, Feng Chia University, Taichung, TaiwanDepartment of Industrial Engineering and System Management, Feng Chia University, Taichung, TaiwanDepartment of Industrial & Engineering Management, National Chiao Tung University, Hsinchu, TaiwanDepartment of Statistics, Feng Chia University, Taichung, TaiwanWe consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-and-bound algorithm is developed to derive the optimal sequence and two simulated annealing heuristic algorithms are proposed to search for the near-optimal solutions. Computational experiments are also conducted to evaluate the proposed branch-and-bound and simulated annealing algorithms.http://dx.doi.org/10.1155/2014/596306 |
| spellingShingle | Wen-Chiung Lee Yau-Ren Shiau Yu-Hsiang Chung Lawson Ding Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents The Scientific World Journal |
| title | Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents |
| title_full | Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents |
| title_fullStr | Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents |
| title_full_unstemmed | Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents |
| title_short | Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents |
| title_sort | single machine scheduling to minimize total completion time and tardiness with two competing agents |
| url | http://dx.doi.org/10.1155/2014/596306 |
| work_keys_str_mv | AT wenchiunglee singlemachineschedulingtominimizetotalcompletiontimeandtardinesswithtwocompetingagents AT yaurenshiau singlemachineschedulingtominimizetotalcompletiontimeandtardinesswithtwocompetingagents AT yuhsiangchung singlemachineschedulingtominimizetotalcompletiontimeandtardinesswithtwocompetingagents AT lawsonding singlemachineschedulingtominimizetotalcompletiontimeandtardinesswithtwocompetingagents |