Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs (Q2410362): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Scheduling an unbounded batching machine with job processing time compatibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5431779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batch processing machine with bipartite compatibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic scheduling on a single batch processing machine with split compatibility graphs / 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: Batch processing with interval graph compatibilities between tasks / 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: An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / 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: Single-machine batch scheduling with job processing time compatibility / 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: Scheduling with batching: A review / 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: 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

Latest revision as of 13:30, 14 July 2024

scientific article
Language Label Description Also known as
English
Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs
scientific article

    Statements

    Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 October 2017
    0 references
    online scheduling
    0 references
    batch machine
    0 references
    compatibility graph
    0 references
    competitive ratio
    0 references
    0 references

    Identifiers