Total completion time minimization in two-machine job shops with unit-time operations (Q1278312): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Wiesław X. Kubiak / rank
 
Normal rank
Property / author
 
Property / author: Timkovsky, Vadim G. / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(96)00132-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089564682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3942735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for a job shop problem / rank
 
Normal rank

Latest revision as of 17:31, 28 May 2024

scientific article
Language Label Description Also known as
English
Total completion time minimization in two-machine job shops with unit-time operations
scientific article

    Statements

    Total completion time minimization in two-machine job shops with unit-time operations (English)
    0 references
    22 February 1999
    0 references
    job shop
    0 references
    unit time operations
    0 references
    mean flow time
    0 references
    polynomial algorithm
    0 references
    0 references
    0 references

    Identifiers