Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms (Q3196375): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Zhen-bo Wang / rank
Normal rank
 
Property / author
 
Property / author: Wen-Xun Xing / rank
Normal rank
 
Property / author
 
Property / author: Zhen-bo Wang / rank
 
Normal rank
Property / author
 
Property / author: Wen-Xun Xing / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1606021957 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1309.0082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Min-Max (Regret) Versions of Some Polynomial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan Minimization in Job Shops: A Linear Time Approximation Scheme / 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: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Approximating Flow and Job Shop Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination of Two-Machine Flow Shop Scheduling and Shortest Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combination of flow shop scheduling and the shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chernoff–Hoeffding Bounds for Applications with Limited Independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization in open shops: A polynomial time approximation scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Shop Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination of parallel machine scheduling and vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Shop Schedules / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:17, 11 July 2024

scientific article
Language Label Description Also known as
English
Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms
scientific article

    Statements

    Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms (English)
    0 references
    0 references
    0 references
    0 references
    29 October 2015
    0 references
    approximation algorithm
    0 references
    combination of optimization problems
    0 references
    job shop
    0 references
    open shop
    0 references
    scheduling
    0 references
    shortest path
    0 references

    Identifiers

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