APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS (Q5315931): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q243609
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Klaus Jansen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of scheduling problems with multi-purpose machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Approximation Guarantees for Job-Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop and Jobshop Schedules: Complexity and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination Complexity of Parallel Price-Directive Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective neighbourhood functions for the flexible job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Algorithms for the 0/1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding algorithm for the routing problem with arbitrary paths and alternative servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Shop Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Shop Schedules / rank
 
Normal rank

Latest revision as of 16:16, 10 June 2024

scientific article; zbMATH DE number 2204247
Language Label Description Also known as
English
APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
scientific article; zbMATH DE number 2204247

    Statements

    APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS (English)
    0 references
    0 references
    0 references
    0 references
    12 September 2005
    0 references
    0 references
    0 references
    0 references
    0 references