batch scheduling with proportional-linear deterioration and outsourcing

Clicks: 182
ID: 152148
2017
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Emerging

Ranked #144 of 1,093 articles by views in journal of power sources

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 1,093 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
We consider the bounded parallel-batch scheduling with proportional-linear deterioration and outsourcing, in which the actual processing time is pj=αj(A+Dt) or pj=αjt. A job is either accepted and processed in batches on a single machine by manufactures themselves or outsourced to the third party with a certain penalty having to be paid. The objective is to minimize the maximum completion time of the accepted jobs and the total penalty of the outsourced jobs. For the pj=αj(A+Dt) model, when all the jobs are released at time zero, we show that the problem is NP-hard and present a pseudo-polynomial time algorithm, respectively. For the pj=αjt model, when the jobs have distinct m (
Reference Key
miao2017mathematicalbatch Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Cuixia Miao;Fanxiao Meng;Juan Zou;Binglin Jia
Journal journal of power sources
Year 2017
DOI
10.1155/2017/6093029
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.