Bounding strategies for the hybrid flow shop scheduling problem (Q545969): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.amc.2011.02.108 / 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.amc.2011.02.108 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2127154245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4396949 / 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: An Exact Method for Solving the Multi-Processor Flow-Shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on parallel machines subject to release dates and delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel machines scheduling with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate decomposition algorithm for scheduling on parallel machines with heads and tails / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Stage, Hybrid Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energetic reasoning revisited: Application to parallel machine scheduling / 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: A review of exact solution methods for the non-preemptive multiprocessor flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hybrid flow shop scheduling problem / 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: Scheduling with limited machine availability / 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: Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2011.02.108 / rank
 
Normal rank

Latest revision as of 21:06, 9 December 2024

scientific article
Language Label Description Also known as
English
Bounding strategies for the hybrid flow shop scheduling problem
scientific article

    Statements

    Bounding strategies for the hybrid flow shop scheduling problem (English)
    0 references
    0 references
    0 references
    24 June 2011
    0 references
    scheduling
    0 references
    hybrid flow shop
    0 references
    lower bounds
    0 references
    heuristics
    0 references

    Identifiers