Online batch scheduling with kind release times and incompatible families to minimize makespan (Q1744626): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Wen-Jie Li / rank
 
Normal rank
Property / author
 
Property / author: Shi-Sheng Li / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-017-1113-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2587551725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Batch Loading and Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms in batch processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling in a parallel batch processing system to minimize makespan using restarts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: LPT online strategy for parallel-machine scheduling with kind release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling one batch processor subject to job release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A flexible on-line scheduling algorithm for batch machine with infinite capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling algorithms for a batch machine with finite capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on unbounded parallel-batch machines to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online over time scheduling on parallel-batch machines: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best semi-online algorithms for unbounded parallel batch scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for minimizing makespan on batch processing machines / rank
 
Normal rank

Latest revision as of 13:21, 15 July 2024

scientific article
Language Label Description Also known as
English
Online batch scheduling with kind release times and incompatible families to minimize makespan
scientific article

    Statements

    Online batch scheduling with kind release times and incompatible families to minimize makespan (English)
    0 references
    0 references
    0 references
    0 references
    19 April 2018
    0 references
    0 references
    scheduling
    0 references
    online algorithm
    0 references
    kind release time
    0 references
    incompatible families
    0 references
    makespan
    0 references
    0 references