New efficient heuristics for scheduling open shops with makespan minimization (Q2147004): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Cython / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Beam-ACO / 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.cor.2022.105744 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4212834980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for scheduling open shops with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four decades of research on the open-shop scheduling problem to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive heuristic algorithms for the open shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch \(\&\) bound algorithm for the open-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved NEH-based heuristic for the permutation flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximate algorithms for the customer order scheduling problem with total completion time objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical and new heuristics for the open-shop problem: A computational evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for the open-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative improvement approach for the nonpreemptive open shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for the open 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: A study on open shop scheduling to minimise total tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A contribution and new heuristics for open shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-level particle swarm optimisation algorithm for open-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive genetic algorithms for the open-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized shifting bottleneck procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new particle swarm optimization for the open shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A label correcting approach for solving bicriterion shortest-path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy open shop heuristic with job priorities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The museum visitor routing problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:51, 29 July 2024

scientific article
Language Label Description Also known as
English
New efficient heuristics for scheduling open shops with makespan minimization
scientific article

    Statements

    New efficient heuristics for scheduling open shops with makespan minimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 June 2022
    0 references
    production scheduling
    0 references
    combinatorial optimization
    0 references
    heuristics
    0 references
    open shop
    0 references
    0 references
    0 references
    0 references

    Identifiers