An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines (Q957356): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030921117 / rank
 
Normal rank
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: 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:29, 28 June 2024

scientific article
Language Label Description Also known as
English
An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines
scientific article

    Statements

    An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines (English)
    0 references
    0 references
    27 November 2008
    0 references
    0 references
    on-line scheduling
    0 references
    parallel machines
    0 references
    batch
    0 references
    worst-case analysis
    0 references
    competitive ratio
    0 references
    0 references