An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times (Q850231): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: BPSS / 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.2005.11.136 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981760439 / 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: Heuristics for scheduling in a flow shop with multiple processors / 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: 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: Scheduling a two-stage hybrid flowshop with separable setup and removal times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a two-stage hybrid flow shop with parallel machines at the first stage / rank
 
Normal rank
Property / cites work
 
Property / cites work: A flowshop scheduling problem with two operations per job / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple non-linear model of immune response / 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: Heuristic scheduling of parallel machines with sequence-dependent set-up times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling flexible flow lines with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in hybrid flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job shop scheduling with group-dependent setups, finite buffers, and long time horizon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm methodology for complex scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast tabu search algorithm for the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for a single-machine scheduling problem with release times and delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The flow shop with parallel machines: A tabu search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-stage flowshop scheduling with a common second-stage machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling flexible flow lines with no in-process buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A MILP model for the<i>n</i>-job,<i>M</i>-stage flowshop with sequence dependent set-up times / 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: On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing n jobs on two machines with setup, processing and removal times separated / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3806968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptable Scheduling Algorithm for Flexible Flow Lines / rank
 
Normal rank

Latest revision as of 22:55, 24 June 2024

scientific article
Language Label Description Also known as
English
An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
scientific article

    Statements

    An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times (English)
    0 references
    15 November 2006
    0 references
    0 references
    short-term scheduling
    0 references
    hybrid flow shops
    0 references
    sequence dependent setup times
    0 references
    makespan
    0 references
    heuristics
    0 references
    immune algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references