A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (Q2434270): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine parallel batch scheduling subject to precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / 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: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single batching machine with release times and non-identical job sizes / 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 note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard / 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 best online algorithm for scheduling on two parallel batch machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a single batch processing machine with non-identical job sizes / 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 07:31, 7 July 2024

scientific article
Language Label Description Also known as
English
A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
scientific article

    Statements

    A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (English)
    0 references
    0 references
    0 references
    0 references
    5 February 2014
    0 references
    scheduling
    0 references
    parallel batch machines
    0 references
    on-line
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references