3.8 Article

Memetic algorithm for unrelated parallel machine scheduling problem with grey processing times

相关参考文献

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

Joint optimization of demand-side operational utility and manufacture-side energy consumption in a distributed parallel machine environment

Like Zhang et al.

Summary: This paper proposes a production scheduling model that takes into account the operational utility from the demand side and integrates energy efficiency goals. By optimizing the operating speed of equipment based on forecasting information and delivery time, the operational utility is improved. Experimental results demonstrate the superiority of the model.

COMPUTERS & INDUSTRIAL ENGINEERING (2022)

Article Multidisciplinary Sciences

An NSGA-II-Based Memetic Algorithm for an Energy-Efficient Unrelated Parallel Machine Scheduling Problem with Machine-Sequence Dependent Setup Times and Learning Effect

Gulcin Bektur

Summary: This study focuses on an energy-efficient unrelated parallel machine scheduling problem, incorporating speed scaling as an energy-efficient strategy. It proposes a multiobjective MILP model and a NSGA-II-based memetic algorithm for the problem.

ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING (2022)

Article Computer Science, Artificial Intelligence

Artificial bee colony algorithm including some components of iterated greedy algorithm for permutation flow shop scheduling problems

Oguzhan Ahmet Arik

Summary: This paper proposes a hybrid solution algorithm that combines the best components of iterated greedy algorithm with artificial bee colony algorithm for permutation flow shop scheduling problems, leading to better solutions compared to variants of iterated greedy algorithms.

NEURAL COMPUTING & APPLICATIONS (2021)

Article Computer Science, Artificial Intelligence

Population-based Tabu search with evolutionary strategies for permutation flow shop scheduling problems under effects of position-dependent learning and linear deterioration

Oguzhan Ahmet Arik

Summary: This paper investigates permutation flow shop scheduling problems under the effects of position-dependent learning and linear deterioration. A hybrid solution algorithm named TS(POP) is proposed to address the problem, with experimental results showing its outperformance in solution quality compared to other existing algorithms.

SOFT COMPUTING (2021)

Article Computer Science, Artificial Intelligence

A Genetic Algorithm Approach to Parallel Machine Scheduling Problems Under Effects of Position-Dependent Learning and Linear Deterioration: Genetic Algorithm to Parallel Machine Scheduling Problems

Oguzhan Ahmet Arik et al.

Summary: This study investigates parallel machine scheduling problems with the objective of minimizing total completion times under the effects of learning and deterioration. The authors proposed a genetic algorithm as a solution, which proved to yield good solutions in short execution times and outperform existing metaheuristic algorithms for the problem.

INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING (2021)

Article Mathematics, Interdisciplinary Applications

Flexible flow shop scheduling with interval grey processing time

Yuquan Wang et al.

Summary: This paper provides a solution for flexible flow shop scheduling with uncertain processing time in aeronautical composite lay-up workshop by establishing a model and algorithm with interval grey processing time. The results show that this approach can optimize scheduling efficiency for composite lay-up shop and similar flow shop scheduling problems.

GREY SYSTEMS-THEORY AND APPLICATION (2021)

Article Computer Science, Artificial Intelligence

A multi-objective multi-micro-swarm leadership hierarchy-based optimizer for uncertain flexible job shop scheduling problem with job precedence constraints

Zhenwei Zhu et al.

Summary: This paper studies an uncertain flexible job shop scheduling problem and proposes a novel multi-objective multiple-micro-swarm leadership hierarchy-based optimization algorithm to solve it, demonstrating its effectiveness through extensive experiments.

EXPERT SYSTEMS WITH APPLICATIONS (2021)

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, Interdisciplinary Applications

Flexible job-shop scheduling problem with job precedence constraints and interval grey processing time

Zhenwei Zhu et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2020)

Article Computer Science, Artificial Intelligence

Comparisons of metaheuristic algorithms for unrelated parallel machine weighted earliness/tardiness scheduling problems

Oguzhan Ahmet Arik

EVOLUTIONARY INTELLIGENCE (2020)

Article Computer Science, Artificial Intelligence

A Hybrid Memetic Algorithm for the Parallel Machine Scheduling Problem With Job Deteriorating Effects

Junwen Ding et al.

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE (2020)

Article Management

Effective heuristic for large-scale unrelated parallel machines scheduling problems

Haibo Wang et al.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2019)

Article Mathematics, Interdisciplinary Applications

Simple assembly line balancing problem of Type 1 with grey demand and grey task durations

Oguzhan Ahmet Arik et al.

GREY SYSTEMS-THEORY AND APPLICATION (2019)

Article Engineering, Manufacturing

Scheduling meets n-fold integer programming

Dusan Knop et al.

JOURNAL OF SCHEDULING (2018)

Article Computer Science, Artificial Intelligence

Flexible job shop scheduling problem with interval grey processing time

Naiming Xie et al.

APPLIED SOFT COMPUTING (2018)

Article Engineering, Industrial

Single machine scheduling problems under position-dependent fuzzy learning effect with fuzzy processing times

M. Duran Toksari et al.

JOURNAL OF MANUFACTURING SYSTEMS (2017)

Article Management

A hybrid genetic algorithm for an identical parallel-machine problem with maintenance activity

Wen-Chiung Lee et al.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2015)

Article Engineering, Industrial

A multi-point simulated annealing heuristic for solving multiple objective unrelated parallel machine scheduling problems

Shih-Wei Lin et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2015)

Article Computer Science, Interdisciplinary Applications

An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem

Francisco J. Rodriguez et al.

COMPUTERS & OPERATIONS RESEARCH (2013)

Article Operations Research & Management Science

GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times

F. J. Rodriguez et al.

ANNALS OF OPERATIONS RESEARCH (2012)

Article Management

A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times

Eva Vallada et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2011)

Article Computer Science, Artificial Intelligence

A hybrid memetic algorithm for maximizing the weighted number of just-in-time jobs on unrelated parallel machines

F. Jolai et al.

JOURNAL OF INTELLIGENT MANUFACTURING (2011)

Article Computer Science, Interdisciplinary Applications

A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival

Tsung-Che Chiang et al.

COMPUTERS & OPERATIONS RESEARCH (2010)

Article Management

A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

Ruben Ruiz et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)

Article Computer Science, Interdisciplinary Applications

A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines

JK Cochran et al.

COMPUTERS & OPERATIONS RESEARCH (2003)

Article Computer Science, Hardware & Architecture

Convex quadratic and semidefinite programming relaxations in scheduling

M Skutella

JOURNAL OF THE ACM (2001)