A polynomial algorithm for a one machine batching problem (Q1197905): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal Scheduling of Products with Two Subassemblies on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching to Minimize Flow Times on One Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for the Two-Variable Integer Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-pass batching algorithms for the one-machine problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686432 / rank
 
Normal rank

Latest revision as of 14:33, 16 May 2024

scientific article
Language Label Description Also known as
English
A polynomial algorithm for a one machine batching problem
scientific article

    Statements

    A polynomial algorithm for a one machine batching problem (English)
    0 references
    16 January 1993
    0 references
    lot-sizing
    0 references
    polynomial algorithms
    0 references
    identical jobs
    0 references
    single machine
    0 references

    Identifiers