A combination of flow shop scheduling and the shortest path problem (Q2354293): 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: Zhen-bo Wang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2160962818 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1309.0081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / 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: Scheduling with incompatible jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Heuristic for Three-Machine Flow Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / 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: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop and Jobshop Schedules: Complexity and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of flow shop scheduling / 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: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise survey of efficiently solvable special cases of the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670909 / 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: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:46, 10 July 2024

scientific article
Language Label Description Also known as
English
A combination of flow shop scheduling and the shortest path problem
scientific article

    Statements

    A combination of flow shop scheduling and the shortest path problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 July 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithm
    0 references
    combination of optimization problems
    0 references
    flow shop scheduling
    0 references
    shortest path
    0 references
    0 references
    0 references