Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem (Q6164382): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithms for Scheduling Runway Operations Under Constrained Position Shifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a two-machine re-entrant flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total tardiness on a two-machine re-entrant flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for two-machine re-entrant shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: New multi-objective method to solve reentrant hybrid flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times / 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: Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for two machine re-entrant flow shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for large multiple knapsack problems / 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: Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hybrid flow shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Makespan in a Class of Reentrant Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-family scheduling in a two-machine reentrant flow shop with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow shops with reentry: reversibility properties and makespan optimal schedules / rank
 
Normal rank

Latest revision as of 15:04, 1 August 2024

scientific article; zbMATH DE number 7706583
Language Label Description Also known as
English
Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem
scientific article; zbMATH DE number 7706583

    Statements

    Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 July 2023
    0 references
    scheduling
    0 references
    reentrant flow shop
    0 references
    mixed integer programming
    0 references
    heuristic
    0 references
    0 references

    Identifiers