Routing open shop and flow shop scheduling problems (Q421573): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ti-Jun Fan / rank
Normal rank
 
Property / author
 
Property / author: Ti-Jun Fan / 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.ejor.2011.02.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011111461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the travelling repairman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time approximation schemes for vehicle scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing Two-Machine Flowshop Problems on Networks with Special Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The routing open-shop problem on a network: complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times / 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: Analysis of Christofides' heuristic: some paths are more difficult than cycles / 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: 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximability result of the multi-vehicle scheduling problem on a path with release and handling times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle scheduling on a tree with release and handling times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special cases of traveling salesman and repairman problems with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-vehicle scheduling problems with release and service times on a line / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:49, 5 July 2024

scientific article
Language Label Description Also known as
English
Routing open shop and flow shop scheduling problems
scientific article

    Statements

    Routing open shop and flow shop scheduling problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 May 2012
    0 references
    0 references
    scheduling
    0 references
    routing
    0 references
    open shop
    0 references
    flow shop
    0 references
    complexity
    0 references
    approximation algorithm
    0 references
    0 references
    0 references