Scheduling Jobs and a Variable Maintenance on a Single Machine with Common Due-Date Assignment
We investigate a common due-date assignment scheduling problem with a variable maintenance on a single machine. The goal is to minimize the total earliness, tardiness, and due-date cost. We derive some properties on an optimal solution for our problem. For a special case with identical jobs we propo...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/748905 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832562721862713344 |
|---|---|
| author | Long Wan |
| author_facet | Long Wan |
| author_sort | Long Wan |
| collection | DOAJ |
| description | We investigate a common due-date assignment scheduling
problem with a variable maintenance on a single machine. The goal is
to minimize the total earliness, tardiness, and due-date cost. We
derive some properties on an optimal solution for our problem. For a
special case with identical jobs we propose an optimal polynomial
time algorithm followed by a numerical example. |
| format | Article |
| id | doaj-art-2810e286edf847b98a1569e9e4a723c0 |
| 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-2810e286edf847b98a1569e9e4a723c02025-02-03T01:21:49ZengWileyThe Scientific World Journal2356-61401537-744X2014-01-01201410.1155/2014/748905748905Scheduling Jobs and a Variable Maintenance on a Single Machine with Common Due-Date AssignmentLong Wan0School of Information Technology, Jiangxi University of Finance and Economics, Nanchang 330013, ChinaWe investigate a common due-date assignment scheduling problem with a variable maintenance on a single machine. The goal is to minimize the total earliness, tardiness, and due-date cost. We derive some properties on an optimal solution for our problem. For a special case with identical jobs we propose an optimal polynomial time algorithm followed by a numerical example.http://dx.doi.org/10.1155/2014/748905 |
| spellingShingle | Long Wan Scheduling Jobs and a Variable Maintenance on a Single Machine with Common Due-Date Assignment The Scientific World Journal |
| title | Scheduling Jobs and a Variable Maintenance on a Single Machine with Common Due-Date Assignment |
| title_full | Scheduling Jobs and a Variable Maintenance on a Single Machine with Common Due-Date Assignment |
| title_fullStr | Scheduling Jobs and a Variable Maintenance on a Single Machine with Common Due-Date Assignment |
| title_full_unstemmed | Scheduling Jobs and a Variable Maintenance on a Single Machine with Common Due-Date Assignment |
| title_short | Scheduling Jobs and a Variable Maintenance on a Single Machine with Common Due-Date Assignment |
| title_sort | scheduling jobs and a variable maintenance on a single machine with common due date assignment |
| url | http://dx.doi.org/10.1155/2014/748905 |
| work_keys_str_mv | AT longwan schedulingjobsandavariablemaintenanceonasinglemachinewithcommonduedateassignment |