An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan (Q1016040): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Yu-Zhong Zhang / rank
Normal rank
 
Property / author
 
Property / author: Yu-Zhong Zhang / 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/s10878-007-9128-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2798229098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batch processing machine with non-identical job sizes / 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: Minimizing mean completion time in a batch processing system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing can be solved within 1+epsilon in linear time / 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 batching machine with release times and non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / 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: Minimizing makespan on a single batch processing machine with nonidentical job sizes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:29, 1 July 2024

scientific article
Language Label Description Also known as
English
An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan
scientific article

    Statements

    An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan (English)
    0 references
    0 references
    0 references
    4 May 2009
    0 references
    0 references
    scheduling
    0 references
    batching
    0 references
    non-identical job sizes
    0 references
    makespan
    0 references
    asymptotic PTAS
    0 references
    0 references