[go: up one dir, main page]

Gómez-Gasquet et al., 2012 - Google Patents

An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan

Gómez-Gasquet et al., 2012

View PDF
Document ID
6575625172339439262
Author
Gómez-Gasquet P
Andrés C
Lario F
Publication year
Publication venue
Expert Systems with Applications

External Links

Snippet

This paper deals with a variant of flowshop scheduling, namely, the hybrid or flexible flowshop with sequence dependent setup times. This type of flowshop is frequently used in the batch production industry and helps reduce the gap between research and operational …
Continue reading at www.academia.edu (PDF) (other versions)

Classifications

    • 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
    • G06F9/48—Programme initiating; Programme switching, e.g. by interrupt
    • G06F9/4806—Task transfer initiation or dispatching
    • G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/12—Computer systems based on biological models using genetic models
    • G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
    • 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
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/505—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the load
    • 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
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformations of program code
    • G06F8/41—Compilation
    • 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
    • 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
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/04—Inference methods or devices
    • 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
    • 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

Similar Documents

Publication Publication Date Title
Gómez-Gasquet et al. An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan
Braune et al. A genetic programming learning approach to generate dispatching rules for flexible shop scheduling problems
Kumar et al. Independent task scheduling in cloud computing by improved genetic algorithm
Engin et al. A new approach to solve hybrid flow shop scheduling problems by artificial immune system
Jungwattanakit et al. A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
Lei Co-evolutionary genetic algorithm for fuzzy flexible job shop scheduling
Gonçalves et al. A genetic algorithm for the resource constrained multi-project scheduling problem
Tang et al. An improved differential evolution algorithm for practical dynamic scheduling in steelmaking-continuous casting production
Shadrokh et al. A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty
Engin et al. An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems
Ranjbar et al. Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm
Olafsson et al. Learning effective new single machine dispatching rules from optimal scheduling data
Herrán et al. A parallel variable neighborhood search approach for the obnoxious p‐median problem
Randall et al. Bingo: a customizable framework for symbolic regression with genetic programming
Tan et al. Analysis and control of networked game dynamics via a microscopic deterministic approach
Queiroz et al. Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time
Xiong et al. A Hybrid Multiobjective Evolutionary Approach for Flexible Job‐Shop Scheduling Problems
Đurasević et al. Heuristic and metaheuristic methods for the unrelated machines scheduling problem: A survey
Marzouki et al. Decentralized Tabu searches in multi agent system for distributed and flexible job shop scheduling problem
Nguyen et al. A genetic programming approach for evolving variable selectors in constraint programming
Shi et al. Different performances of different intelligent algorithms for solving FJSP: a perspective of structure
Arsuaga-Ríos et al. Meta-schedulers for grid computing based on multi-objective swarm algorithms
Frutos et al. Comparison of multiobjective evolutionary algorithms for operations scheduling under machine availability constraints
Ramachandra et al. Sequencing precedence-related jobs on two machines to minimize the weighted completion time
Nouri et al. A holonic multiagent model based on a combined genetic algorithm─ tabu search for the flexible job shop scheduling problem