Improved dynamic programs for some batching problems involving the maximum lateness criterion (Q1593711): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improved Algorithms for Economic Lot Size Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of one-machine batching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4859840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch sizing and job sequencing on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling the production of two-component jobs on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching in single operation manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Groups of Jobs on a Single Machine / rank
 
Normal rank

Latest revision as of 12:37, 3 June 2024

scientific article
Language Label Description Also known as
English
Improved dynamic programs for some batching problems involving the maximum lateness criterion
scientific article

    Statements

    Improved dynamic programs for some batching problems involving the maximum lateness criterion (English)
    0 references
    0 references
    0 references
    4 October 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    batching
    0 references
    scheduling
    0 references
    dynamic programming
    0 references
    computational complexity
    0 references
    lateness
    0 references