A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (Q1767678): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A flexible flowshop problem with total flow time minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The job shop scheduling problem: Conventional and new solution techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2735585 / 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: Scheduling jobs with release dates and tails on identical machines to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jackson's pseudo preemptive schedule for the \(Pm/r_i, q_i/C_{\text{max}}\) scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Method for Solving the Multi-Processor Flow-Shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Processor Scheduling with Start-Times and Deadlines / 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: Two-Stage, Hybrid Flowshop Scheduling Problem / 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: Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop / 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: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in hybrid flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and bound crossed with GA to solve hybrid flowshops / 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: Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling algorithms for flexible flowshops: Worst and average case performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art / rank
 
Normal rank

Latest revision as of 19:38, 7 June 2024

scientific article
Language Label Description Also known as
English
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
scientific article

    Statements

    A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (English)
    0 references
    0 references
    0 references
    8 March 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Multiprocessor flowshop
    0 references
    Lower bounds
    0 references
    Branch and bound
    0 references
    Constraint propagation
    0 references
    0 references
    0 references
    0 references