Due-Window Assignment Scheduling with Variable Job Processing Times
We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e., deteriorating effect). The problem is to deter...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2015/740750 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832545501377986560 |
|---|---|
| author | Yu-Bin Wu Ping Ji |
| author_facet | Yu-Bin Wu Ping Ji |
| author_sort | Yu-Bin Wu |
| collection | DOAJ |
| description | We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e., deteriorating effect). The problem is to determine the optimal due-windows, and the processing sequence simultaneously to minimize a cost function includes earliness, tardiness, the window location, window size, and weighted number of tardy jobs. We prove that the problem can be solved in polynomial time. |
| format | Article |
| id | doaj-art-466a1b1d127a4cc3a68e9ca8d58e85c8 |
| institution | Kabale University |
| issn | 2356-6140 1537-744X |
| language | English |
| publishDate | 2015-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | The Scientific World Journal |
| spelling | doaj-art-466a1b1d127a4cc3a68e9ca8d58e85c82025-02-03T07:25:33ZengWileyThe Scientific World Journal2356-61401537-744X2015-01-01201510.1155/2015/740750740750Due-Window Assignment Scheduling with Variable Job Processing TimesYu-Bin Wu0Ping Ji1School of Science, Shenyang Aerospace University, Shenyang 110136, ChinaDepartment of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong KongWe consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e., deteriorating effect). The problem is to determine the optimal due-windows, and the processing sequence simultaneously to minimize a cost function includes earliness, tardiness, the window location, window size, and weighted number of tardy jobs. We prove that the problem can be solved in polynomial time.http://dx.doi.org/10.1155/2015/740750 |
| spellingShingle | Yu-Bin Wu Ping Ji Due-Window Assignment Scheduling with Variable Job Processing Times The Scientific World Journal |
| title | Due-Window Assignment Scheduling with Variable Job Processing Times |
| title_full | Due-Window Assignment Scheduling with Variable Job Processing Times |
| title_fullStr | Due-Window Assignment Scheduling with Variable Job Processing Times |
| title_full_unstemmed | Due-Window Assignment Scheduling with Variable Job Processing Times |
| title_short | Due-Window Assignment Scheduling with Variable Job Processing Times |
| title_sort | due window assignment scheduling with variable job processing times |
| url | http://dx.doi.org/10.1155/2015/740750 |
| work_keys_str_mv | AT yubinwu duewindowassignmentschedulingwithvariablejobprocessingtimes AT pingji duewindowassignmentschedulingwithvariablejobprocessingtimes |