Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date

•Fully polynomial time approximation scheme for early work maximization is proposed.•The new FPTAS dominates PTAS for the two-machine case known from the literature.•Complexity of parallel machine scheduling problems with common due date is studied.•Theoretical studies are completed with computation...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 284; číslo 1; s. 67 - 74
Hlavní autoři: Chen, Xin, Liang, Yage, Sterna, Małgorzata, Wang, Wen, Błażewicz, Jacek
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.07.2020
Témata:
Early work
Fully polynomial time approximation scheme
Late work
Parallel identical machines
Scheduling
Fully polynomial time approximation scheme
Late work
Scheduling
Early work
Parallel identical machines
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•Fully polynomial time approximation scheme for early work maximization is proposed.•The new FPTAS dominates PTAS for the two-machine case known from the literature.•Complexity of parallel machine scheduling problems with common due date is studied.•Theoretical studies are completed with computational experiments. We study the scheduling problem on parallel identical machines in order to maximize the total early work, i.e. the parts of non-preemptive jobs executed before a common due date, and investigate mainly the model with a fixed number of machines, for which a dynamic programming approach and a fully polynomial time approximation scheme (FPTAS) are proposed. The proposal of these methods allowed us to establish the complexity and approximability status of this problem more exactly. Moreover, since our FPTAS can be also applied for the two-machine case, we improve considerably the result known in the literature for this model, in which a polynomial time approximation scheme (PTAS) was given. The new FPTAS has not only the best computational complexity, but also the much better approximation ratio than the PTAS. Finally, the theoretical studies are completed with computational experiments, performed for dynamic programming, PTAS and FPTAS, showing the high efficiencies of FPTAS both in terms of time consumption and solution quality.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2019.12.003