Parallel machines scheduling with nonsimultaneous machine available time (Q757232): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Ya. M. Shafransky / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Ya. M. Shafransky / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Bin-Packing to Multiprocessor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Asymptotic Optimality of the LPT Rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Bounds for the Multifit Processor Scheduling Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of a MULTIFIT-based scheduling algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor scheduling: Combining LPT and MULTIFIT / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0166-218x(91)90013-m / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077711297 / rank
 
Normal rank

Latest revision as of 08:33, 30 July 2024

scientific article
Language Label Description Also known as
English
Parallel machines scheduling with nonsimultaneous machine available time
scientific article

    Statements

    Parallel machines scheduling with nonsimultaneous machine available time (English)
    0 references
    0 references
    1991
    0 references
    A generalization of the known m parallel identical machines non- preemptive scheduling problem in which the object is to minimize the makespan (the total completion time) is considered. The difference to other approaches consists in the presence of release times for the machines, i.e. for every machine \(m_ i\) the earliest time \(a_ i\) that the machine can start to process the jobs is given. Two approximate algorithms are proposed. The following results are obtained. Denote by M and \(M^*\) the makespan for approximate and optimal schedule respectively. Then for the known LPT algorithm (the longest processing time) the relationship \(M\leq ((3/2)-(1/2m))M^*\) holds. For a modification of the LPT algorithm the author obtained \(M\leq 4M^*/3\). The time complexity of the algorithms is O(n log n\(+n \log m)\) and \(O((n+m)\log (n+m)+(n+m)m)\) respectively. As shown, the performance guarantee for the LPT algorithm is tight, i.e. a sample of the problem exists where \(M=((3/2)+(1/2m))M^*\).
    0 references
    parallel identical machines non-preemptive scheduling
    0 references
    makespan
    0 references
    approximate algorithms
    0 references

    Identifiers