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

Hajinejad et al., 2011 - Google Patents

A fast hybrid particle swarm optimization algorithm for flow shop sequence dependent group scheduling problem

Hajinejad et al., 2011

View HTML
Document ID
14673677822884580714
Author
Hajinejad D
Salmasi N
Mokhtari R
Publication year
Publication venue
Scientia Iranica

External Links

Snippet

Abstract A Particle Swarm Optimization (PSO) algorithm for a Flow Shop Sequence Dependent Group Scheduling (FSDGS) problem, with minimization of total flow time as the criterion (F m| fmls, S plk, prmu|∑ C j), is proposed in this research. An encoding scheme …
Continue reading at www.sciencedirect.com (HTML) (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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/02—Computer systems based on biological models using neural network models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • 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/04—Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/02—Knowledge representation
    • G06N5/022—Knowledge engineering, knowledge acquisition
    • 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
    • G06Q30/00—Commerce, e.g. shopping or e-commerce

Similar Documents

Publication Publication Date Title
Hajinejad et al. A fast hybrid particle swarm optimization algorithm for flow shop sequence dependent group scheduling problem
Jamrus et al. Hybrid particle swarm optimization combined with genetic operators for flexible job-shop scheduling under uncertain processing time for semiconductor manufacturing
Banharnsakun et al. Job shop scheduling with the best-so-far ABC
Liao et al. A discrete version of particle swarm optimization for flowshop scheduling problems
Niu et al. An improved intelligent water drops algorithm for achieving optimal job-shop scheduling solutions
Deb et al. A genetic algorithm based augmented Lagrangian method for constrained optimization
Yang et al. Multi-species cuckoo search algorithm for global optimization
Mokhtari et al. A multi-objective flow shop scheduling with resource-dependent processing times: trade-off between makespan and cost of resources
Moradi et al. Non-dominated ranked genetic algorithm for a multi-objective mixed-model assembly line sequencing problem
Fan et al. An effective modified binary particle swarm optimization (mBPSO) algorithm for multi-objective resource allocation problem (MORAP)
EP3671566A1 (en) Program, information processing method, and information processing device
Gai et al. A novel hybrid meta-heuristic algorithm for optimization problems
Li et al. Multi-robot task allocation based on cloud ant colony algorithm
Anantathanavit et al. Using K-means radius particle swarm optimization for the travelling salesman problem
Afshar-Nadjafi et al. Project scheduling with limited resources using an efficient differential evolution algorithm
Lohpetch et al. A hybrid multi-objective genetic algorithm with a new local search approach for solving the post enrolment based course timetabling problem
Sels et al. A hybrid Electromagnetism-like Mechanism/tabu search procedure for the single machine scheduling problem with a maximum lateness objective
Waris et al. Framework for product innovation using SOEKS and decisional DNA
Sharma et al. Teaching-learning-based optimization for static and dynamic load dispatch
Chen et al. Hybrid grey wolf optimizer for solving permutation flow shop scheduling problem
Singh et al. Differential evolution: An overview
Do et al. A Three‐Species Food Chain System with Two Types of Functional Responses
Mohanty et al. Genetic algorithm for multi-choice integer linear programming problems
Cheung et al. A supervised particle swarm algorithm for real-parameter optimization
KR et al. Solving a job shop scheduling problem