An improved two-machine flowshop scheduling with intermediate transportation (Q266074): 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: Guo-Hui Lin / rank
Normal rank
 
Property / author
 
Property / author: Guo-Hui Lin / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6567815 / rank
 
Normal rank
Property / zbMATH Keywords
 
flowshop scheduling
Property / zbMATH Keywords: flowshop scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
bin-packing
Property / zbMATH Keywords: bin-packing / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithm
Property / zbMATH Keywords: approximation algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
worst-case performance analysis
Property / zbMATH Keywords: worst-case performance analysis / 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.1007/s10878-014-9825-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971099568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with job delivery coordination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with batch deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing can be solved within 1+epsilon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 71/60 theorem for bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling with intermediate transportation under job physical space consideration / 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: Q3883869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4290987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic algorithm for the machine scheduling problem with job delivery coordination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the machine scheduling problem with job delivery coordination / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:29, 11 July 2024

scientific article
Language Label Description Also known as
English
An improved two-machine flowshop scheduling with intermediate transportation
scientific article

    Statements

    An improved two-machine flowshop scheduling with intermediate transportation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 April 2016
    0 references
    0 references
    flowshop scheduling
    0 references
    bin-packing
    0 references
    approximation algorithm
    0 references
    worst-case performance analysis
    0 references
    0 references