☆ 4.7 Article

A Variant Iterated Greedy Algorithm Integrating Multiple Decoding Rules for Hybrid Blocking Flow Shop Scheduling Problem

MATHEMATICS (2023)

Related references

Note: Only part of the references are listed.

Article Automation & Control Systems

Solving energy-efficient fuzzy hybrid flow-shop scheduling problem at a variable machine speed using an extended NSGA-II

Yi-Jian Wang et al.

Summary: This study focuses on the energy-efficient fuzzy hybrid flow-shop scheduling problem (EFHFSP) and extends the existing non-dominated sorting genetic algorithm-II (NSGA-II) to minimize fuzzy make-span and total fuzzy energy consumption simultaneously. Reverse learning is used to generate the initial population, and a novel strategy based on history information is applied to produce high-quality solutions. Extensive experiments have been conducted to verify the performance of ENSGA-II, which shows promising results for EFHFSP.

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2023)

Add to Collection

Article Computer Science, Artificial Intelligence

An improved multi-population genetic algorithm with a greedy job insertion inter-factory neighborhood structure for distributed heterogeneous hybrid flow shop scheduling problem

Hanghao Cui et al.

Summary: Distributed heterogeneous hybrid flow shop scheduling problem (DHHFSP) is an extension of the classical hybrid flow shop scheduling problem (HFSP) that considers collaboration and heterogeneity among multiple factories. This study focuses on improving the inter-factory neighborhood structure and proposes an improved multi-population genetic algorithm (IMPGA) to solve the DHHFSP. The IMPGA outperforms other algorithms in terms of solution quality and efficiency.

EXPERT SYSTEMS WITH APPLICATIONS (2023)

Add to Collection

Article Computer Science, Artificial Intelligence

Energy-Efficient Iterative Greedy Algorithm for the Distributed Hybrid Flow Shop Scheduling With Blocking Constraints

Haoxiang Qin et al.

Summary: This paper studies the energy-efficient distributed hybrid flow-shop scheduling problem (DHFSP) with blocking constraints and proposes an improvement on the greedy algorithm to optimize job sequence. The proposed algorithm includes a global search strategy, a selection mechanism inspired by Q-learning, and five types of local search strategies for blocking constraints. Simulation results show that the algorithm outperforms other high-performance algorithms in terms of convergence rate and solution quality.

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE (2023)

Add to Collection

Article Management

A parameter-Less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows

Ahmed Missaoui et al.

Summary: Hybrid Flowshop Scheduling Problems (HFS) are realistic machine sequencing models. We propose a new local search procedure IG, which produces state-of-the-art results according to comprehensive computational experiments.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2022)

Add to Collection

Article Computer Science, Artificial Intelligence

An improved iterated greedy algorithm for the energy-efficient blocking hybrid flow shop scheduling problem

Hao-Xiang Qin et al.

Summary: With the development of national economies, attention has been drawn to the issues of energy consumption and pollution emissions in manufacturing. Most existing research has focused on reducing economic costs and energy consumption, with limited studies on the energy-efficient hybrid flow shop scheduling problem, especially with blocking constraints. This paper presents a mathematical model for the blocking hybrid flow shop problem with an energy-efficient criterion and proposes a modified Iterative Greedy algorithm to optimize the model.

SWARM AND EVOLUTIONARY COMPUTATION (2022)

Add to Collection

Article Computer Science, Artificial Intelligence

Intelligent optimization under blocking constraints: A novel iterated greedy algorithm for the hybrid flow shop group scheduling problem

Haoxiang Qin et al.

Summary: This paper introduces a new flow shop combinatorial optimization problem, called the blocking hybrid flow shop group scheduling problem (BHFGSP). The proposed algorithm, a novel iterated greedy algorithm, is effective in solving the BHFGSP. Experimental results demonstrate the algorithm's performance.

KNOWLEDGE-BASED SYSTEMS (2022)

Add to Collection

Article Computer Science, Artificial Intelligence

An effective iterative greedy algorithm for distributed blocking flowshop scheduling problem with balanced energy costs criterion

Xue Han et al.

Summary: In this paper, a distributed blocking flowshop scheduling problem with sequence-dependent setup times (DBFSP_SDST) is proposed to address the distributed flowshop scheduling problem (DPFSP) with blocking constraints and sequence-dependent setup times (SDST). The goal is to minimize the energy consumption cost of the critical factory under resource balance. An effective iterated greedy algorithm based on a learning-based variable neighborhood search algorithm (VNIG) is developed to solve this problem. Extensive simulation experiments demonstrate the superior performance of the proposed VNIG compared to other algorithms.

APPLIED SOFT COMPUTING (2022)

Add to Collection

Article Computer Science, Artificial Intelligence

A collaborative iterative greedy algorithm for the scheduling of distributed heterogeneous hybrid flow shop with blocking constraints

Hao-Xiang Qin et al.

Summary: This paper investigates the distributed heterogeneous hybrid flow shop problems with blocking constraints and proposes a mathematical model and algorithm. Experimental results demonstrate that the proposed algorithm outperforms other algorithms in terms of objective values and relative percentage deviation values.

EXPERT SYSTEMS WITH APPLICATIONS (2022)

Add to Collection

Article Computer Science, Artificial Intelligence

An iterated greedy algorithm for the parallel blocking flow shop scheduling problem and sequence-dependent setup times

Imma Ribas et al.

Summary: This paper addresses the scheduling problem in a parallel flow shop configuration with sequence-dependent setup times. The analysis of various iterated greedy algorithms led to the identification of an efficient algorithm to minimize maximum job completion time. Computational evaluation highlighted the efficiency of searching in different neighborhood structures and the significant impact of the initial solution on performance.

EXPERT SYSTEMS WITH APPLICATIONS (2021)

Add to Collection

Article Computer Science, Artificial Intelligence

New benchmark algorithm for hybrid flowshop scheduling with identical machines

Shih-Wei Lin et al.

Summary: HFSP is a well-recognized scheduling problem in industrial applications, and the NP-hard nature of the problem requires effective solution approaches. The proposed Chaos-enhanced Simulated Annealing algorithm showed strong performance in terms of computational efficiency and stability, making it a promising benchmark for solving HFSP and its extensions.

EXPERT SYSTEMS WITH APPLICATIONS (2021)

Add to Collection

Article Computer Science, Interdisciplinary Applications

A discrete whale swarm algorithm for hybrid flow-shop scheduling problem with limited buffers

Chunjiang Zhang et al.

Summary: This paper studies a hybrid flow-shop scheduling problem from a diesel engine assembly plant and proposes a discrete whale swarm algorithm to efficiently find near-optimal solutions. The algorithm adopts a characteristic encoding method and delayed decoding strategy, and designs new distance calculation and individual movement rules.

ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING (2021)

Add to Collection

Article Computer Science, Artificial Intelligence

A collaborative variable neighborhood descent algorithm for the hybrid flowshop scheduling problem with consistent sublots

Biao Zhang et al.

Summary: This paper introduces the issue of consistent sublots into the hybrid flowshop scheduling problem and develops a mixed integer linear programming (MILP) model and a collaborative variable neighborhood descent algorithm (CVND). The CVND shows excellent performance in local exploitation and global search, with high algorithm efficiency. Results indicate that the CVND has significant advantages in solution quality and relative percentage deviation values.

APPLIED SOFT COMPUTING (2021)

Add to Collection

Article Automation & Control Systems

A population-based iterated greedy algorithm to minimize total flowtime for the distributed blocking flowshop scheduling problem

Shuai Chen et al.

Summary: This paper proposes a population-based iterated greedy algorithm to solve the distributed blocking flowshop scheduling problem, which effectively combines constructive heuristic, offspring generation, and local search, outperforming existing algorithms in comprehensive experimental evaluation.

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2021)

Add to Collection

Article Computer Science, Artificial Intelligence

An Adaptive Iterated Greedy algorithm for distributed mixed no-idle permutation flowshop scheduling problems

Yuan-Zhen Li et al.

Summary: This research focuses on distributed permutation flow shop scheduling problem with mixed no-idle constraints, using a mixed-integer linear programming model and an Adaptive Iterated Greedy algorithm with restart strategy. The algorithm shows excellent performance in large-scale experiments.

SWARM AND EVOLUTIONARY COMPUTATION (2021)

Add to Collection

Article Computer Science, Interdisciplinary Applications

An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors - A case study

M. K. Marichelvam et al.

COMPUTERS & OPERATIONS RESEARCH (2020)

Add to Collection

Article Computer Science, Artificial Intelligence

An effective iterated greedy method for the distributed permutation fl owshop scheduling problem with sequence-dependent setup times

Jiang-Ping Huang et al.

SWARM AND EVOLUTIONARY COMPUTATION (2020)

Add to Collection

Article Management

Iterated Greedy methods for the distributed permutation flowshop scheduling problem

Ruben Ruiz et al.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2019)

Add to Collection

Article Computer Science, Interdisciplinary Applications

Constraint guided accelerated search for mixed blocking permutation flowshop scheduling

Vahid Riahi et al.

COMPUTERS & OPERATIONS RESEARCH (2019)

Add to Collection

Article Automation & Control Systems

An efficient discrete invasive weed optimization for blocking flow-shop scheduling problem

Zhongshi Shao et al.

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2019)

Add to Collection

Article Computer Science, Interdisciplinary Applications

Metaheuristic algorithms for the hybrid flowshop scheduling problem

Hande Oztop et al.

COMPUTERS & OPERATIONS RESEARCH (2019)

Add to Collection

Article Computer Science, Interdisciplinary Applications

An Improved Artificial Bee Colony algorithm for real-world hybrid flowshop rescheduling in Steelmaking-refining-Continuous Casting process

Kunkun Peng et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2018)

Add to Collection

Article Computer Science, Artificial Intelligence

Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness

Victor Fernandez-Viagas et al.

EXPERT SYSTEMS WITH APPLICATIONS (2018)

Add to Collection

Article Computer Science, Artificial Intelligence

New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics

Victor Fernandez-Viagas et al.

EXPERT SYSTEMS WITH APPLICATIONS (2018)

Add to Collection

Review Management

A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation

Victor Fernandez-Viagas et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2017)

Add to Collection

Article Computer Science, Artificial Intelligence

An effective modified migrating birds optimization for hybrid flowshop scheduling problem with lot streaming

Biao Zhang et al.

APPLIED SOFT COMPUTING (2017)

Add to Collection

Article Engineering, Industrial

A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling

Shijin Wang et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2015)

Add to Collection

Article Engineering, Multidisciplinary

A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations

Parviz Fattahi et al.

APPLIED MATHEMATICAL MODELLING (2014)

Add to Collection

Article Computer Science, Artificial Intelligence

A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem

Jun-qing Li et al.

APPLIED SOFT COMPUTING (2014)

Add to Collection

Article Computer Science, Artificial Intelligence

A Discrete Firefly Algorithm for the Multi-Objective Hybrid Flowshop Scheduling Problems

Mariappan Kadarkarainadar Marichelvam et al.

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2014)

Add to Collection

Article Automation & Control Systems

Multi-job lot streaming to minimize the weighted completion time in a hybrid flow shop scheduling problem with work shift constraint

Mohsen Nejati et al.

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2014)

Add to Collection

Article Management

An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem

Quan-Ke Pan et al.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2014)

Add to Collection

Article Management

A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation

Quan-Ke Pan et al.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2014)

Add to Collection

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)

Add to Collection

Article Automation & Control Systems

An enhanced estimation of distribution algorithm for solving hybrid flow-shop scheduling problem with identical parallel machines

Sheng-yao Wang et al.

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2013)

Add to Collection

Article Engineering, Industrial

Energy-aware scheduling for improving manufacturing process sustainability: A mathematical model for flexible flow shops

A. A. G. Bruzzone et al.

CIRP ANNALS-MANUFACTURING TECHNOLOGY (2012)

Add to Collection

Article Management

Effective heuristics for the blocking flowshop scheduling problem with makespan minimization

Quan-Ke Pan et al.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2012)

Add to Collection

Review Management

The hybrid flow shop scheduling problem

Ruben Ruiz et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2010)

Add to Collection

Article Computer Science, Interdisciplinary Applications

Scheduling a hybrid flowshop with batch production at the last stage

Hua Xuan et al.

COMPUTERS & OPERATIONS RESEARCH (2007)

Add to Collection

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)

Add to Collection

Article Engineering, Industrial

Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem

ZH Jin et al.

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2006)

Add to Collection

Review Engineering, Industrial

Flowshop-scheduling problems with makespan criterion: a review

SR Hejazi et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2005)

Add to Collection

Article Engineering, Industrial

A note on constructive heuristics for the flowshop problem with blocking

DP Ronconi

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2004)

Add to Collection

Article Management

A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities

B Wardono et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2004)

Add to Collection

Article Engineering, Manufacturing

Simplification methods for accelerating simulation-based real-time scheduling in a semiconductor wafer fabrication facility

YD Kim et al.

IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING (2003)

Add to Collection

Article Engineering, Industrial

Sequencing a hybrid two-stage flowshop with dedicated machines

F Riane et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2002)

Add to Collection

© Peeref 2019-2024. All rights reserved.