Parallel-batch scheduling with two models of deterioration to minimize the makespan (Q1724245): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59038763, #quickstatements; #temporary_batch_1707232231678
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 04:29, 5 March 2024

scientific article
Language Label Description Also known as
English
Parallel-batch scheduling with two models of deterioration to minimize the makespan
scientific article

    Statements

    Parallel-batch scheduling with two models of deterioration to minimize the makespan (English)
    0 references
    0 references
    14 February 2019
    0 references
    Summary: We consider the bounded parallel-batch scheduling with two models of deterioration, in which the processing time of the first model is \(p_j = a_j + \alpha t\) and of the second model is \(p_j = a + \alpha_j t\). The objective is to minimize the makespan. We present \(O(n \text{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.
    0 references

    Identifiers