4.7 Article

MIP modeling of energy-conscious FJSP and its extended problems:From simplicity to complexity

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Green & Sustainable Science & Technology

An MILP Model for Energy-Conscious Flexible Job Shop Problem with Transportation and Sequence-Dependent Setup Times

Leilei Meng et al.

Summary: As environmental awareness grows, the focus on energy-aware scheduling is increasing. This study addresses the flexible job shop scheduling problem with sequence-dependent setup times and transportation times (FJSP-SDST-T) and aims to minimize energy consumption. A mixed integer linear programming (MILP) model is proposed to solve this problem. Experimental results demonstrate the effectiveness of the MILP model on extended benchmark cases.

SUSTAINABILITY (2023)

Article Computer Science, Artificial Intelligence

MILP modeling and optimization of multi-objective flexible job shop scheduling problem with controllable processing times

Leilei Meng et al.

Summary: This paper addresses the flexible job shop scheduling problem with controllable processing times (FJSP-CPT) and proposes a mixed integer linear programming (MILP) model for small-scale instances. For medium and large-sized problems, an efficient multi-objective hybrid shuffled frog-leaping algorithm (MO-HS-FLA) is proposed. The algorithm includes an energy-efficient decoding method and a multi-objective variable local search (MO-VNS) algorithm.

SWARM AND EVOLUTIONARY COMPUTATION (2023)

Article Computer Science, Artificial Intelligence

An automatic multi-objective evolutionary algorithm for the hybrid flowshop scheduling problem with consistent sublots

Biao Zhang et al.

Summary: This paper studies a multi-objective hybrid flowshop scheduling problem with consistent sublots and proposes an automated algorithm design method to optimize a multi-objective evolutionary algorithm. By determining the combinations of numerical and categorical parameters, a trade-off between two conflicting objectives is achieved, and computational results demonstrate the superiority of the automated algorithm over other methods.

KNOWLEDGE-BASED SYSTEMS (2022)

Article Computer Science, Artificial Intelligence

Optimization of energy-efficient open shop scheduling with an adaptive multi-objective differential evolution algorithm

Lijun He et al.

Summary: This paper focuses on the energy-efficient open shop scheduling problem (EOSSP) and proposes a multi-objective energy-efficient model based on machine speed scaling mechanism. An adaptive multi-objective differential evolution algorithm is used to solve the problem. Experimental results demonstrate that the proposed algorithm outperforms the other three well-known algorithms in addressing the EOSSP.

APPLIED SOFT COMPUTING (2022)

Article Engineering, Multidisciplinary

A novel heuristic method for the energy-efficient flexible job-shop scheduling problem with sequence-dependent set-up and transportation time

Hongliang Zhang et al.

Summary: This study proposes a multi-objective mixed-integer linear programming model to solve the energy-efficient FJSP considering sequence-dependent set-up and transportation times, and introduces an effective novel heuristic method. Through comparison with 48 instances, the method is demonstrated to outperform other algorithms, obtaining scheduling schemes with lower makespan and total energy consumption.

ENGINEERING OPTIMIZATION (2022)

Article Computer Science, Interdisciplinary Applications

The distributed flowshop scheduling problem with delivery dates and cumulative payoffs

Yuan-Zhen Li et al.

Summary: This paper investigates a new problem in the field of DPFSP, focusing on optimizing task scheduling by maximizing total payoff. The authors propose a mathematical model, explore the problem characteristics, and propose new heuristic algorithms to improve efficiency. Experimental results demonstrate the effectiveness of the presented algorithm.

COMPUTERS & INDUSTRIAL ENGINEERING (2022)

Article Computer Science, Artificial Intelligence

Efficient multiobjective optimization for an AGV energy-efficient scheduling problem with release time

Wen-Qiang Zou et al.

Summary: Green manufacturing has gained significant attention, but the energy efficiency problem in matrix manufacturing workshops remains unaddressed. This paper proposes a novel automatic guided vehicle (AGV) energy-efficient scheduling problem with release time (AGVEESR) to optimize energy consumption, number of AGVs used, and customer satisfaction simultaneously.

KNOWLEDGE-BASED SYSTEMS (2022)

Article Computer Science, Artificial Intelligence

A referenced iterated greedy algorithm for the distributed assembly mixed no-idle permutation flowshop scheduling problem with the total tardiness criterion

Yuan-Zhen Li et al.

Summary: This paper studies the distributed assembly mixed no-idle permutation flowshop scheduling problem (DAMNIPFSP) with the objective of minimizing total tardiness. An improved Iterated Greedy algorithm named RIG (Referenced Iterated Greedy) is proposed, which includes two novel destruction methods, four new reconstruction methods, and six new local search methods based on the characteristics of DAMNIPFSP. Experimental results show that RIG algorithm is a state-of-the-art procedure for DAMNIPFSP with the total tardiness criterion.

KNOWLEDGE-BASED SYSTEMS (2022)

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)

Article Computer Science, Artificial Intelligence

Novel MILP and CP models for distributed hybrid flowshop scheduling problem with sequence-dependent setup times

Leilei Meng et al.

Summary: This study addresses the problem of distributed hybrid flow shop scheduling with sequence-dependent setup times. Three novel mathematical models are proposed and compared with existing models, demonstrating their effectiveness. Experimental results show that the model based on sequence-based modeling performs the best, while the existing model performs the worst. Additionally, the constraint programming model is more efficient and effective than the mathematical models.

SWARM AND EVOLUTIONARY COMPUTATION (2022)

Article Computer Science, Artificial Intelligence

A green scheduling algorithm for the distributed flowshop problem

Yuan-Zhen Li et al.

Summary: This paper addresses the energy-efficient scheduling of the distributed permutation flowshop with an improved NSGAII algorithm. Problem-specific characteristics are analyzed and new operators are designed to optimize the solution. Constructive heuristic algorithms, inspired by the artificial bee colony algorithm, are proposed to generate high-quality initial solutions and a local intensification method is designed to exploit better non-dominated solutions. The effectiveness of the proposed INSGAII in solving EEDPFSP is verified through computational tests and comparisons.

APPLIED SOFT COMPUTING (2021)

Article Automation & Control Systems

An imperialist competitive algorithm with feedback for energy-efficient flexible job shop scheduling with transportation and sequence-dependent setup times

Ming Li et al.

Summary: This paper discusses the energy-efficient flexible job shop scheduling problem (EFJSP) with transportation and sequence-dependent setup times (SDST), and develops an imperialist competitive algorithm with feedback (FICA) to minimize makespan, total tardiness, and total energy consumption simultaneously. The FICA algorithm incorporates assimilation, adaptive revolution, solution transferring among empires, and reinforced search. Extensive experiments demonstrate that FICA provides promising results for EFJSP with transportation and SDST.

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2021)

Article Computer Science, Artificial Intelligence

A Bi-Population Cooperative Memetic Algorithm for Distributed Hybrid Flow-Shop Scheduling

Jing-Jing Wang et al.

Summary: In this article, the distributed hybrid flow-shop scheduling problem is addressed with an optimization framework comprising a mixed integer linear programming model and a bi-population cooperative memetic algorithm (BCMA). Collaborative initialization and intensification search are used to generate diverse solutions and balance exploration and exploitation. Extensive computational tests show the effectiveness of the BCMA in solving the DHFSP and verifying the optimization capabilities of the specific designs.

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE (2021)

Article Engineering, Industrial

More MILP models for hybrid flow shop scheduling problem and its extended problems

Leilei Meng et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2020)

Article Computer Science, Interdisciplinary Applications

A hybrid metaheuristic algorithm for a profit-oriented and energy-efficient disassembly sequencing problem

Qi Lu et al.

ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING (2020)

Article Computer Science, Interdisciplinary Applications

Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem

Leilei Meng et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2020)

Article Computer Science, Theory & Methods

An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints

Guohui Zhang et al.

Swarm and Evolutionary Computation (2020)

Article Computer Science, Information Systems

MILP Modeling and Optimization of Energy- Efficient Distributed Flexible Job Shop Scheduling Problem

Leilei Meng et al.

IEEE ACCESS (2020)

Article Engineering, Industrial

Mathematical modelling and optimisation of energy-conscious hybrid flow shop scheduling problem with unrelated parallel machines

Leilei Meng et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2019)

Article Engineering, Industrial

Green permutation flowshop scheduling problem with sequence-dependent setup times: a case study

Reza Ramezanian et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2019)

Article Green & Sustainable Science & Technology

MILP models for energy-aware flexible job shop scheduling problem

Leilei Meng et al.

JOURNAL OF CLEANER PRODUCTION (2019)

Article Engineering, Industrial

Job-shop scheduling problem with energy consideration

Oussama Masmoudi et al.

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2019)

Article Management

Solving the flexible job shop scheduling problem with sequence-dependent setup times

Liji Shen et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2018)

Article Engineering, Industrial

A shuffled frog-leaping algorithm for flexible job shop scheduling with the consideration of energy consumption

Deming Lei et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2017)

Article Green & Sustainable Science & Technology

A hybrid fruit fly algorithm for solving flexible job-shop scheduling to reduce manufacturing carbon footprint

Qiong Liu et al.

JOURNAL OF CLEANER PRODUCTION (2017)

Article Engineering, Multidisciplinary

Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm

Sajad Karimi et al.

APPLIED MATHEMATICAL MODELLING (2017)

Article Engineering, Industrial

A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem

Jin Deng et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2016)

Article Engineering, Industrial

An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem

Xinyu Li et al.

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2016)

Article Engineering, Industrial

More MILP models for integrated process planning and scheduling

Liangliang Jin et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2016)

Article Automation & Control Systems

An improved model and novel simulated annealing for distributed job shop problems

Bahman Naderi et al.

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2015)

Article Computer Science, Artificial Intelligence

Modeling and heuristics for scheduling of distributed job shops

B. Naderi et al.

EXPERT SYSTEMS WITH APPLICATIONS (2014)

Article Engineering, Industrial

Modeling and scheduling no-wait open shop problems

B. Naderi et al.

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2014)

Article Engineering, Multidisciplinary

Evaluation of mathematical models for flexible job-shop scheduling problems

Yunus Demir et al.

APPLIED MATHEMATICAL MODELLING (2013)

Article Engineering, Industrial

Mathematical modelling and a meta-heuristic for flexible job shop scheduling

V. Roshanaei et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2013)

Article Engineering, Industrial

Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness

M. Mousakhani

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2013)

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 Automation & Control Systems

Modeling and scheduling open shops with sequence-dependent setup times to minimize total completion time

Bahman Naderi et al.

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2011)

Article Engineering, Industrial

A study on open shop scheduling to minimise total tardiness

B. Naderi et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2011)

Article Mathematics, Applied

Scheduling open shops with parallel machines to minimize total completion time

B. Naderi et al.

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS (2011)

Article Engineering, Multidisciplinary

Mathematical models for job-shop scheduling problems with routing and process plan flexibility

Cemal Ozguven et al.

APPLIED MATHEMATICAL MODELLING (2010)

Article Computer Science, Interdisciplinary Applications

Modeling and scheduling a case of flexible flowshops: Total weighted tardiness minimization

B. Naderi et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2009)

Article Computer Science, Interdisciplinary Applications

Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times

Pedro Leite Rocha et al.

COMPUTERS & OPERATIONS RESEARCH (2008)

Article Computer Science, Artificial Intelligence

Mathematical modeling and heuristic approaches to flexible job shop scheduling problems

Parviz Fattahi et al.

JOURNAL OF INTELLIGENT MANUFACTURING (2007)

Article Automation & Control Systems

Flexible job shop scheduling with tabu search algorithms

Mohammad Saidi-Mehrabad et al.

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY (2007)