\(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints (Q1029003): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q162228
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Cheng, T. C. Edwin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1492534264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of two-machine no-wait flowshop scheduling with availability constraints. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for two-machine no-wait flowshop scheduling with an availability constraint / rank
 
Normal rank

Latest revision as of 19:03, 1 July 2024

scientific article
Language Label Description Also known as
English
\(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints
scientific article

    Statements