online scheduling with delivery time on a bounded parallel batch machine with limited restart

Clicks: 36
ID: 250714
2015
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
Steady

Ranked #932 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 online (over time) scheduling of equal length jobs on a bounded parallel batch machine with batch capacity b to minimize the time by which all jobs have been delivered with limited restart. Here, “restart” means that a running batch may be interrupted, losing all the work done on it, and jobs in the interrupted batch are then released and become independently unscheduled jobs, called restarted jobs. “Limited restart” means that a running batch which contains some restarted jobs cannot be restarted again. When b=2, we propose a best possible online algorithm H(b=2) with a competitive ratio of 1+α, where α is the positive solution of 2α(1+α)=1. When b≥3, we present a best possible online algorithm H(b≥3) with a competitive ratio of 1+β, where β is the positive solution of β(1+β)2=1.
Reference Key
liu2015mathematicalonline Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Hailing Liu;Long Wan;Zhigang Yan;Jinjiang Yuan
Journal journal of power sources
Year 2015
DOI
10.1155/2015/628254
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.