Maximizing total early work in a distributed two‐machine flow‐shop (Q6078603): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1002/nav.22076 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/nav.22076 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4292731281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-machine flow-shop problem with weighted late work criterion and common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mirror scheduling problems with early work and late work criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shop scheduling with a common due date to maximize total early work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for the parallel two-stage flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized tractability of the just-in-time flow-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical-Path Planning and Scheduling: Mathematical Basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with assignable due dates to minimize maximum and total late work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions for the two-machine robust flow shop with budgeted uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of machine scheduling: 15 open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distributed permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scatter search algorithm for the distributed permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling to Minimize Total Late Work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with assignable due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/NAV.22076 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:14, 30 December 2024

scientific article; zbMATH DE number 7754099
Language Label Description Also known as
English
Maximizing total early work in a distributed two‐machine flow‐shop
scientific article; zbMATH DE number 7754099

    Statements

    Maximizing total early work in a distributed two‐machine flow‐shop (English)
    0 references
    0 references
    0 references
    0 references
    24 October 2023
    0 references
    distributed flow-shop
    0 references
    dynamic programming
    0 references
    early work
    0 references
    FPTAS
    0 references
    integer linear programming
    0 references
    scheduling
    0 references
    two-machine flow-shop
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references