Preemptive hybrid flowshop scheduling problem of interval orders (Q5956203): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q126865199, #quickstatements; #temporary_batch_1719535215180
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and bound algorithm for the flow shop with multiple processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling preemptive jobs with precedence constraints on parallel machines / 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: A computational study of heuristics for two-stage flexible flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Stage, Hybrid Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-stage parallel-processor flowshop problem with minimum flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global lower bounds for flow shops with multiple processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126865199 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:50, 28 June 2024

scientific article; zbMATH DE number 1708912
Language Label Description Also known as
English
Preemptive hybrid flowshop scheduling problem of interval orders
scientific article; zbMATH DE number 1708912

    Statements

    Preemptive hybrid flowshop scheduling problem of interval orders (English)
    0 references
    0 references
    0 references
    20 January 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    flowshop
    0 references
    parallel machines
    0 references
    preemptive scheduling
    0 references
    interval order
    0 references
    linear programming
    0 references
    0 references