Online scheduling on unbounded parallel-batch machines with incompatible job families (Q533882): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Sumit K. Garg / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5886218 / rank
 
Normal rank
Property / zbMATH Keywords
 
online scheduling
Property / zbMATH Keywords: online scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
parallel-batch machines
Property / zbMATH Keywords: parallel-batch machines / rank
 
Normal rank
Property / zbMATH Keywords
 
incompatible job families
Property / zbMATH Keywords: incompatible job families / rank
 
Normal rank
Property / zbMATH Keywords
 
competitive ratio
Property / zbMATH Keywords: competitive ratio / 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.1016/j.tcs.2011.01.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966397500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms in batch processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Batch Loading and Scheduling Problem / 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: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan / 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: An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing 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: Scheduling batch processing machines with incompatible job families / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for minimizing makespan on batch processing machines / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:24, 4 July 2024

scientific article
Language Label Description Also known as
English
Online scheduling on unbounded parallel-batch machines with incompatible job families
scientific article

    Statements

    Online scheduling on unbounded parallel-batch machines with incompatible job families (English)
    0 references
    0 references
    0 references
    10 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    online scheduling
    0 references
    parallel-batch machines
    0 references
    incompatible job families
    0 references
    competitive ratio
    0 references
    0 references