Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan
We consider the bounded parallel-batch scheduling with two models of deterioration, in which the processing time of the first model is pj=aj+αt and of the second model is pj=a+αjt. The objective is to minimize the makespan. We present O(n log n) time algorithms for the single-machine problems, respe...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2014-01-01
|
| Series: | Abstract and Applied Analysis |
| Online Access: | http://dx.doi.org/10.1155/2014/495187 |
| id |
doaj-03de634934274ee080e366a5c118ae55 |
|---|---|
| record_format |
Article |
| spelling |
doaj-03de634934274ee080e366a5c118ae552020-11-25T00:02:47ZengHindawi LimitedAbstract and Applied Analysis1085-33751687-04092014-01-01201410.1155/2014/495187495187Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the MakespanCuixia Miao0School of Mathematical Sciences, Qufu Normal University, Qufu, Shandong 273165, ChinaWe consider the bounded parallel-batch scheduling with two models of deterioration, in which the processing time of the first model is pj=aj+αt and of the second model is pj=a+αjt. The objective is to minimize the makespan. We present O(n log n) time algorithms for the single-machine problems, respectively. And we propose fully polynomial time approximation schemes to solve the identical-parallel-machine problem and uniform-parallel-machine problem, respectively.http://dx.doi.org/10.1155/2014/495187 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Cuixia Miao |
| spellingShingle |
Cuixia Miao Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan Abstract and Applied Analysis |
| author_facet |
Cuixia Miao |
| author_sort |
Cuixia Miao |
| title |
Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan |
| title_short |
Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan |
| title_full |
Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan |
| title_fullStr |
Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan |
| title_full_unstemmed |
Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan |
| title_sort |
parallel-batch scheduling with two models of deterioration to minimize the makespan |
| publisher |
Hindawi Limited |
| series |
Abstract and Applied Analysis |
| issn |
1085-3375 1687-0409 |
| publishDate |
2014-01-01 |
| description |
We consider the bounded parallel-batch scheduling with two models of deterioration, in which the processing time of the first model is pj=aj+αt and of the second model is pj=a+αjt. The objective is to minimize the makespan. We present O(n log n) time algorithms for the single-machine problems, respectively. And we propose fully polynomial time approximation schemes to solve the identical-parallel-machine problem and uniform-parallel-machine problem, respectively. |
| url |
http://dx.doi.org/10.1155/2014/495187 |
| work_keys_str_mv |
AT cuixiamiao parallelbatchschedulingwithtwomodelsofdeteriorationtominimizethemakespan |
| _version_ |
1725436671050121216 |