Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine (Q1290647): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Hoogeveen, J. A. / rank
Normal rank
 
Property / author
 
Property / author: Hoogeveen, J. A. / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching and Scheduling Jobs on Batch and Discrete Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Lower and Upper Bounds for Scheduling Around a Small Common Due Date / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:25, 28 May 2024

scientific article
Language Label Description Also known as
English
Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine
scientific article

    Statements

    Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine (English)
    0 references
    0 references
    0 references
    18 October 1999
    0 references
    machine scheduling problems
    0 references
    mathematical formulation
    0 references
    positional completion times
    0 references
    batching
    0 references
    flow shop scheduling
    0 references
    total completion time
    0 references
    Lagrangian relaxation
    0 references

    Identifiers