Batch scheduling of nonidentical job sizes with minsum criteria (Q2051908): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127862464, #quickstatements; #temporary_batch_1728163453908
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-019-00419-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2946024102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal absolute ratio for online bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the absolute approximation ratio for first fit and related results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for batch scheduling with nonidentical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing with general cost structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient scheduling algorithms for a single batch processing machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan with release times on identical parallel batching machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4290987 / 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: Tighter bounds of the First Fit algorithm for the bin-packing problem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127862464 / rank
 
Normal rank

Latest revision as of 22:35, 5 October 2024

scientific article
Language Label Description Also known as
English
Batch scheduling of nonidentical job sizes with minsum criteria
scientific article

    Statements

    Batch scheduling of nonidentical job sizes with minsum criteria (English)
    0 references
    0 references
    0 references
    0 references
    25 November 2021
    0 references
    scheduling
    0 references
    bin-packing
    0 references
    worst-case ratio
    0 references
    batch machine
    0 references
    0 references
    0 references
    0 references

    Identifiers

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