4.7 Article

One-Machine Scheduling with Time-Dependent Capacity via Efficient Memetic Algorithms

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Artificial Intelligence

Combining hyper-heuristics to evolve ensembles of priority rules for on-line scheduling

Francisco J. Gil-Gala et al.

Summary: This paper proposes a combination of Genetic Programming and Genetic Algorithm to solve an online scheduling problem. The experimental results show that this approach produces better ensembles compared to the previous one and is available earlier.

NATURAL COMPUTING (2022)

Article Computer Science, Artificial Intelligence

A memetic algorithm for restoring feasibility in scheduling with limited makespan

Raul Mencia et al.

Summary: This paper focuses on repairing infeasibility in job shop scheduling problems with a hard constraint on the makespan. It proposes an efficient memetic algorithm that combines a genetic algorithm with a local search method. Experimental results demonstrate the practicality of this approach.

NATURAL COMPUTING (2022)

Article Computer Science, Artificial Intelligence

Minimizing the sum of makespan on multi-agent single-machine scheduling with release dates

Xinyue Wang et al.

Summary: This article introduces competitive scheduling problems in integrated-services packet-switched networks, discussing different algorithms used to minimize the sum of makespans for multiple competing applications. The proposed branch and bound algorithm, hybrid discrete artificial bee colony algorithm, and deep reinforcement learning method are evaluated and shown effective for solving the problem.

SWARM AND EVOLUTIONARY COMPUTATION (2022)

Article Mathematics

A Simple and Effective Approach for Tackling the Permutation Flow Shop Scheduling Problem

Mohamed Abdel-Basset et al.

Summary: In this research, a new approach based on the improved elitism continuous genetic algorithm is proposed to tackle the permutation flow shop scheduling problem. By combining different crossover and re-initialization strategies, the algorithm shows significant improvement in both exploitation and exploration aspects.

MATHEMATICS (2021)

Article Mathematics

Performance of a Novel Chaotic Firefly Algorithm with Enhanced Exploration for Tackling Global Optimization Problems: Application for Dropout Regularization

Nebojsa Bacanin et al.

Summary: An enhanced version of the firefly algorithm was proposed in this paper, addressing the drawbacks of the original method through an exploration mechanism and local search strategy. This algorithm was validated for selecting the optimal dropout rate for deep neural network regularization and also applied in image processing tasks.

MATHEMATICS (2021)

Article Chemistry, Multidisciplinary

Solving Non-Permutation Flow Shop Scheduling Problem with Time Couplings

Radoslaw Idzikowski et al.

Summary: This paper considers a non-permutation variant of the Flow Shop Scheduling Problem with Time Couplings and makespan minimization, proposing an exact Branch and Bound algorithm and two metaheuristic algorithms for solving. Experimental results show that the Tabu Search method outperforms other methods and provides high quality solutions with a small gap to the optimal solution.

APPLIED SCIENCES-BASEL (2021)

Article Automation & Control Systems

Efficient repairs of infeasible job shop problems by evolutionary algorithms

Raul Mencia et al.

Summary: We address the task of repairing infeasibility in job shop scheduling problems with a hard constraint on the maximum makespan. By adopting a job-based view of repairs and proposing enhancements to a genetic algorithm, we aim to improve efficiency and effectiveness in solving the problem. The proposed methods show significant improvements in experimental results.

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2021)

Article Engineering, Manufacturing

A memetic algorithm to address the multi-node resource-constrained project scheduling problem

Luis F. Machado-Dominguez et al.

Summary: The multi-mode resource-constrained project scheduling problem (MRCPSP) is a general model for selecting a combination of time/resources to minimize project duration while completing all activities and satisfying resource constraints and precedence relationships. This study proposes a memetic algorithm for solving MRCPSP, which integrates components of genetic algorithms and variable neighborhood search to adjust the uniform crossover operator and evaluate agents' performance through local search, showing outstanding performance in different instances of standard libraries.

JOURNAL OF SCHEDULING (2021)

Article Computer Science, Artificial Intelligence

Iterated local search for single machine total weighted tardiness batch scheduling

Eduardo Queiroga et al.

Summary: This paper introduces an iterated local search algorithm for the single machine scheduling problem, which has practical significance in solving batch scheduling problems. The proposed algorithm is compared with dynamic programming methods, showing competitiveness and efficiency through experiments.

JOURNAL OF HEURISTICS (2021)

Article Computer Science, Artificial Intelligence

Scheduling for airport baggage transport vehicles based on diversityenhancement genetic algorithm

Weian Guo et al.

NATURAL COMPUTING (2020)

Article Management

Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints

Leonardo Cabral R. Soares et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2020)

Article Computer Science, Artificial Intelligence

A GA based hierarchical feature selection approach for handwritten word recognition

Samir Malakar et al.

NEURAL COMPUTING & APPLICATIONS (2020)

Article Chemistry, Multidisciplinary

An Efficient Local Search Heuristic for Earth Observation Satellite Integrated Scheduling

Yuning Chen et al.

APPLIED SCIENCES-BASEL (2020)

Article Computer Science, Artificial Intelligence

Evolutionary one-machine scheduling in the context of electric vehicles charging

Carlos Mencia et al.

INTEGRATED COMPUTER-AIDED ENGINEERING (2019)

Article Computer Science, Artificial Intelligence

Evolving priority rules for on-line scheduling of jobs on a single machine with variable capacity over time

Francisco J. Gil-Gala et al.

APPLIED SOFT COMPUTING (2019)

Article Computer Science, Artificial Intelligence

The single machine scheduling problem with sequence-dependent setup times and a learning effect on processing times

Settar Mustu et al.

APPLIED SOFT COMPUTING (2018)

Article Computer Science, Interdisciplinary Applications

A modified particle swarm optimization algorithm for a batch-processing machine scheduling problem with arbitrary release times and non-identical job sizes

Hongming Zhou et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2018)

Article Computer Science, Artificial Intelligence

IBM ILOG CP optimizer for scheduling 20+years of scheduling with constraints at IBM/ILOG

Philippe Laborie et al.

CONSTRAINTS (2018)

Article Computer Science, Interdisciplinary Applications

Mixed Integer Programming models for job shop scheduling: A computational analysis

Wen-Yang Ku et al.

COMPUTERS & OPERATIONS RESEARCH (2016)

Article Computer Science, Theory & Methods

Cloud Computing Resource Scheduling and a Survey of Its Evolutionary Approaches

Zhi-Hui Zhan et al.

ACM COMPUTING SURVEYS (2015)

Article Computer Science, Interdisciplinary Applications

Electric vehicle charging under power and balance constraints as dynamic scheduling

Alejandro Hernandez-Arauzo et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2015)

Article Automation & Control Systems

A GRASP-based memetic algorithm with path relinking for the far from most string problem

Jose E. Gallardo et al.

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2015)

Article Computer Science, Artificial Intelligence

New schedule generation schemes for the job-shop problem with operators

Maria R. Sierra et al.

JOURNAL OF INTELLIGENT MANUFACTURING (2015)

Proceedings Paper Computer Science, Artificial Intelligence

Failure-Directed Search for Constraint-Based Scheduling

Petr Vilim et al.

INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING (2015)

Article Management

An extended Akers graphical method with a biased random-key genetic algorithm for job-shop scheduling

Jose Fernando Goncalves et al.

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH (2014)

Article Computer Science, Interdisciplinary Applications

An efficient memetic algorithm for solving the job shop scheduling problem

Liang Gao et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2011)

Article Computer Science, Artificial Intelligence

A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms

Joaquin Derrac et al.

SWARM AND EVOLUTIONARY COMPUTATION (2011)

Article Computer Science, Interdisciplinary Applications

A simulated annealing algorithm for single machine scheduling problems with family setups

Feng Jin et al.

COMPUTERS & OPERATIONS RESEARCH (2009)

Article Management

A genetic algorithm for the resource constrained multi-project scheduling problem

J. F. Goncalves et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2008)

Article Management

Scheduling flow shops using differential evolution algorithm

G Onwubolu et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2006)

Article Operations Research & Management Science

Schedule generation schemes for the job-shop problem with sequence-dependent setup times: Dominance properties and computational analysis

C Artigues et al.

ANNALS OF OPERATIONS RESEARCH (2005)

Article Engineering, Manufacturing

An advanced tabu search algorithm for the job shop problem

E Nowicki et al.

JOURNAL OF SCHEDULING (2005)

Article Management

Supply chain scheduling: Batching and delivery

NG Hall et al.

OPERATIONS RESEARCH (2003)

Article Computer Science, Artificial Intelligence

Ant colony optimization for resource-constrained project scheduling

D Merkle et al.

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2002)

Article Management

A memetic algorithm for the total tardiness single machine scheduling problem

PM França et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2001)