Nothing Special   »   [go: up one dir, main page]

Ren et al., 2016 - Google Patents

Immune genetic algorithm for multi-objective flexible job-shop scheduling problem

Ren et al., 2016

Document ID
14743373828272627370
Author
Ren H
Xu H
Sun S
Publication year
Publication venue
2016 Chinese control and decision conference (CCDC)

External Links

Snippet

In this paper, the multi-objective flexible job-shop scheduling problem (FJSP) is studied and formulated in a mixed integer programming model. Combining the artificial immune mechanism and genetic algorithm, an immune genetic algorithm is proposed to solve the …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063—Operations research or analysis

Similar Documents

Publication Publication Date Title
Ren et al. Immune genetic algorithm for multi-objective flexible job-shop scheduling problem
Zhao et al. An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem
Brandão et al. A biased random‐key genetic algorithm for single‐round divisible load scheduling
Wang et al. Simulated Annealing‐Based Krill Herd Algorithm for Global Optimization
Skakovski et al. An island-based differential evolution algorithm with the multi-size populations
Li et al. Iterated local search for distributed multiple assembly no-wait flowshop scheduling
Mniszewski Graph partitioning as quadratic unconstrained binary optimization (QUBO) on spiking neuromorphic hardware
Xuan et al. A novel genetic simulated annealing algorithm for no-wait hybrid flowshop problem with unrelated parallel machines
Lim et al. Hyper-heuristic for flexible job shop scheduling problem with stochastic job arrivals
Bewoor et al. Comparative analysis of metaheuristic approaches for makespan minimization for no wait flow shop scheduling problem
Mahdavi et al. Aggregate hybrid flowshop scheduling with assembly operations
Chaudhry et al. No-wait flowshop scheduling using genetic algorithm
Valdez et al. Bio-inspired optimization methods on graphic processing unit for minimization of complex mathematical functions
Matousek et al. Heuristic approaches to stochastic quadratic assignment problem: Var and cvar cases
Zhu et al. A quantum‐inspired cuckoo co‐evolutionary algorithm for no‐wait flow shop scheduling
Jolai et al. Simulated annealing and imperialist competitive algorithm for minimising makespan in an open shop
He et al. A hybrid distribution algorithm based on membrane computing for solving the multiobjective multiple traveling salesman problem
Kawaguchi et al. Parallel reactive tabu search for job shop scheduling problems considering peak shift of electric power energy consumption
Allaoua Combination of genetic algorithm with dynamic programming for solving TSP
Ali Genetic local search algorithm with self-adaptive population resizing for solving global optimization problems
Robert et al. A Hybrid Algorithm for Minimizing Makespan in the Permutation Flow Shop Scheduling Environment
Carvalho et al. An EDA with swarm intelligence for the multi-objective flexible job-shop problem
Chamnanlor et al. Bi-objective optimization for reentrant shop scheduling problem
Wang et al. Application of interval theory and genetic algorithm for uncertain integrated process planning and scheduling
Ding et al. Minimizing makespan for a no-wait flowshop using tabu mechanism improved iterated greedy algorithm