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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Abstract and Applied Analysis |
| Online Access: | http://dx.doi.org/10.1155/2014/495187 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832561609735667712 |
|---|---|
| author | Cuixia Miao |
| author_facet | Cuixia Miao |
| author_sort | Cuixia Miao |
| collection | DOAJ |
| 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. |
| format | Article |
| id | doaj-art-03de634934274ee080e366a5c118ae55 |
| institution | Kabale University |
| issn | 1085-3375 1687-0409 |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Abstract and Applied Analysis |
| spelling | doaj-art-03de634934274ee080e366a5c118ae552025-02-03T01:24:32ZengWileyAbstract 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 |
| spellingShingle | Cuixia Miao Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan Abstract and Applied Analysis |
| title | 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_short | 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 |
| url | http://dx.doi.org/10.1155/2014/495187 |
| work_keys_str_mv | AT cuixiamiao parallelbatchschedulingwithtwomodelsofdeteriorationtominimizethemakespan |