Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited (Q515553): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q456070
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2017.01.018 / 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/j.tcs.2017.01.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2584278511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for flow-shop and open-shop scheduling problems with transportation delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shop Problems With Two Machines and Time Lags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of problem \(TF2|v=1,c=2|C_{\max}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization for flow-shop problems with transportation times and a single robot / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER / 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: Machine scheduling with transportation considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with pickup and delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transporting jobs through a two‐machine open shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shop scheduling with delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of flow shop scheduling problems with transportation constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production scheduling with supply and delivery considerations to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of flow shop scheduling with transportation constraints / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2017.01.018 / rank
 
Normal rank

Latest revision as of 20:06, 9 December 2024

scientific article
Language Label Description Also known as
English
Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited
scientific article

    Statements

    Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 March 2017
    0 references
    flow shop problems
    0 references
    NP-hardness
    0 references
    complexity
    0 references

    Identifiers

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