[go: up one dir, main page]

Köksalan et al., 2003 - Google Patents

Using genetic algorithms for single-machine bicriteria scheduling problems

Köksalan et al., 2003

Document ID
16692608826624345753
Author
Köksalan M
Keha A
Publication year
Publication venue
European Journal of Operational Research

External Links

Snippet

We consider two bicriteria scheduling problems on a single machine: minimizing flowtime and number of tardy jobs, and minimizing flowtime and maximum earliness. Both problems are known to be NP-hard. For the first problem, we developed a heuristic that produces an …
Continue reading at www.sciencedirect.com (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
    • 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
    • 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
    • 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/10—Office automation, e.g. computer aided management of electronic mail or groupware; Time management, e.g. calendars, reminders, meetings or time accounting
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F2207/72—Indexing scheme relating to groups G06F7/72 - G06F7/729
    • G06F2207/7219—Countermeasures against side channel or fault attacks
    • 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
    • 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
    • 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
Köksalan et al. Using genetic algorithms for single-machine bicriteria scheduling problems
Behnamian et al. A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties
Rangsaritratsamee et al. Dynamic rescheduling that simultaneously considers efficiency and stability
Caraffa et al. Minimizing makespan in a blocking flowshop using genetic algorithms
Pongcharoen et al. Determining optimum genetic algorithm parameters for scheduling the manufacturing and assembly of complex products
Ponnambalam et al. Genetic algorithms for sequencing problems in mixed model assembly lines
Wagner et al. Time series forecasting for dynamic environments: the DyFor genetic program model
Kurz et al. Heuristic scheduling of parallel machines with sequence-dependent set-up times
Roshani et al. Mixed-model multi-manned assembly line balancing problem: a mathematical model and a simulated annealing approach
Mattfeld et al. An efficient genetic algorithm for job shop scheduling with tardiness objectives
Lei et al. Hybrid flow shop scheduling with assembly operations and key objectives: A novel neighborhood search
Borumand et al. A developed genetic algorithm for solving the multi-objective supply chain scheduling problem
Köksoy et al. Robust design using Pareto type optimization: a genetic algorithm with arithmetic crossover
Liu et al. Solving the rotating seru production problem with dynamic multi-objective evolutionary algorithms
Ripon et al. Integrated job shop scheduling and layout planning: A hybrid evolutionary method for optimizing multiple objectives
Atabaki et al. Hybrid genetic algorithm and invasive weed optimization via priority based encoding for location-allocation decisions in a three-stage supply chain
Xuan et al. An Improved Discrete Artificial Bee Colony Algorithm for Flexible Flowshop Scheduling with Step Deteriorating Jobs and Sequence‐Dependent Setup Times
Parveen et al. Review on job-shop and flow-shop scheduling using
Kumar et al. A genetic algorithm for a flow shop scheduling problem with breakdown interval, transportation time and weights of jobs
Osman et al. An effective genetic algorithm approach to multiobjective routing problems (MORPs)
Yu et al. A two-stage algorithm based on 12 priority rules for the stochastic distributed resource-constrained multi-project scheduling problem with multi-skilled staff
Mehdizadeh et al. A bi-objective multi-item capacitated lot-sizing model: two Pareto-based meta-heuristic algorithms
Pongchairerks et al. A particle swarm optimization algorithm on job-shop scheduling problems with multi-purpose machines
Kim Candidate order based genetic algorithm (COGA) for constrained sequencing problems
Iris et al. A review of genetic algorithm applications in supply chain network design