The complexity of one-machine batching problems (Q1315991): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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: Batch sizing and job sequencing 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: One-pass batching algorithms for the one-machine problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching in single operation manufacturing systems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:28, 22 May 2024

scientific article
Language Label Description Also known as
English
The complexity of one-machine batching problems
scientific article

    Statements

    The complexity of one-machine batching problems (English)
    0 references
    0 references
    0 references
    25 July 1994
    0 references
    batching
    0 references
    sequencing
    0 references
    partitioning
    0 references
    shortest path problem
    0 references
    NP-hard
    0 references

    Identifiers