Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2008.01.007 / 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: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Heuristic Algorithm for the Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for scheduling in flowshop with multiple objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing CONWIP flow-shops: Analysis and heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck-focused scheduling for a hybrid flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem / 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: A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flow shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ant colony system for permutation flow-shop sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling flow shops using differential evolution algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm for the job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm for the open shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective heuristic for the CLSP with set-up times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the resource-constrained project scheduling problem by a variable neighbourhood search. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: BoneRoute: An adaptive memory-based method for effective fleet management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guide to vehicle routing heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic method for the flow shop sequencing problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2008.01.007 / rank
 
Normal rank

Latest revision as of 10:03, 10 December 2024

scientific article
Language Label Description Also known as
English
Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
scientific article

    Statements

    Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (English)
    0 references
    0 references
    0 references
    0 references
    4 December 2008
    0 references
    production scheduling
    0 references
    permutation flow shop
    0 references
    variable neighbourhood search
    0 references

    Identifiers