A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint (Q2672605): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2022.04.044 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q114129111 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4224981819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook on Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling on multiple two-stage flowshops with a deadline / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a two-stage flowshop under makespan constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops / 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: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Approximation Scheme for the Multiple Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Approximation Scheme for the Multiple Knapsack 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: Q4941826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Methods in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stirling numbers of the second kind / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: On scheduling inclined jobs on multiple two-stage flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling two-stage jobs on multiple flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for two-stage flowshops scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On scheduling multiple two-stage flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the parallel flow shop problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2022.04.044 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:11, 19 December 2024

scientific article
Language Label Description Also known as
English
A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
scientific article

    Statements

    A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2022
    0 references
    parallel two-stage flowshops
    0 references
    makespan constraint
    0 references
    polynomial-time approximation scheme
    0 references
    multiple knapsacks
    0 references
    rounding
    0 references

    Identifiers