The routing open-shop problem on a network: complexity and approximation (Q2496075): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q2734595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Delivery Man Problem and Cumulative Matroids / 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: Vehicle scheduling on a tree with release and handling times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine shop scheduling problems with batch processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine open shop scheduling with special transportation times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the two-machine open-shop scheduling problem with transportation times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group technology approach to the open shop scheduling problem with batch setup times / rank
 
Normal rank

Latest revision as of 17:49, 24 June 2024

scientific article
Language Label Description Also known as
English
The routing open-shop problem on a network: complexity and approximation
scientific article

    Statements

    The routing open-shop problem on a network: complexity and approximation (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2006
    0 references
    0 references
    heuristics
    0 references
    scheduling
    0 references
    approximation
    0 references
    0 references