Results 131 to 140 of about 4,911,676 (214)
Some of the next articles are maybe not open access.
Knowledge-Based Systems, 2022
This paper introduces a new flow shop combinatorial optimization problem, called the blocking hybrid flow shop group scheduling problem (BHFGSP). In the problem, no buffers exist between any adjacent machines, and a set of jobs with different sequence ...
Hao-Xiang Qin +5 more
semanticscholar +1 more source
This paper introduces a new flow shop combinatorial optimization problem, called the blocking hybrid flow shop group scheduling problem (BHFGSP). In the problem, no buffers exist between any adjacent machines, and a set of jobs with different sequence ...
Hao-Xiang Qin +5 more
semanticscholar +1 more source
Swarm and Evolutionary Computation, 2021
With the continuous development of national economies, problems of various energy consumption levels and pollution emissions in manufacturing have attracted attention from researchers.
Hao-Xiang Qin +6 more
semanticscholar +1 more source
With the continuous development of national economies, problems of various energy consumption levels and pollution emissions in manufacturing have attracted attention from researchers.
Hao-Xiang Qin +6 more
semanticscholar +1 more source
Swarm and Evolutionary Computation, 2021
In this paper, a genetic programming hyper heuristic (GP-HH) algorithm is proposed to solve the distributed assembly permutation flow-shop scheduling problem with sequence dependent setup times (DAPFSP-SDST) and the objective of makespan minimization ...
Hongna Song, Jian Lin
semanticscholar +1 more source
In this paper, a genetic programming hyper heuristic (GP-HH) algorithm is proposed to solve the distributed assembly permutation flow-shop scheduling problem with sequence dependent setup times (DAPFSP-SDST) and the objective of makespan minimization ...
Hongna Song, Jian Lin
semanticscholar +1 more source
Multiobjective flow-shop scheduling
Naval Research Logistics, 1990Summary: Previous research on the scheduling of multimachine systems has generally focused on the optimization of individual performance measures. This article considers the sequencing of jobs through a multimachine flow shop, where the quality of the resulting schedule is evaluated according to the associted levels of two scheduling criteria, schedule
Daniels, Richard L., Chambers, Robert J.
openaire +2 more sources
Reinforcement learning for robotic flow shop scheduling with processing time variations
International Journal of Production Research, 2021We address a robotic flow shop scheduling problem where two part types are processed on each given set of dedicated machines. A single robot moving on a fixed rail transports one part at a time, and the processing times of the parts vary on the machines ...
Jun-Ho Lee, Hyun-Jung Kim
semanticscholar +1 more source
IEEE Transactions on Cybernetics, 2021
As an extension of the classical flow-shop scheduling problem, the hybrid flow-shop scheduling problem (HFSP) widely exists in large-scale industrial production systems and has been considered to be challenging for its complexity and flexibility ...
Jia-xu Fan +5 more
semanticscholar +1 more source
As an extension of the classical flow-shop scheduling problem, the hybrid flow-shop scheduling problem (HFSP) widely exists in large-scale industrial production systems and has been considered to be challenging for its complexity and flexibility ...
Jia-xu Fan +5 more
semanticscholar +1 more source
A Knowledge-Based Cooperative Algorithm for Energy-Efficient Scheduling of Distributed Flow-Shop
IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2020Facing increasingly serious ecological problems, sustainable development and green manufacturing have attracted much attention. Meanwhile, with the development of globalization, distributed manufacturing is becoming widespread.
Jing-jing Wang, Ling Wang
semanticscholar +1 more source
Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
Journal of Algorithms, 1993The authors analyse two machine open shop and flow shop scheduling problems. The objective is to minimize the mean job completion time and job preemption is possible. Whereas these two problems on three machines are known to be NP-hard in the strong sense, the complexity status of the two machine problems has been unsolved. In this article, the authors
Du, Jianzhong, Leung, Joseph Y.-T.
openaire +1 more source
On transforming job-shops into flow-shops
Production Planning & Control, 2002In this paper the problem of transforming a job-shop environment into a flow-shop is addressed, where scheduling issues are simpler and pull production control systems might be easily applied. A linear programming model employing machine investment minimization as objective function is proposed.
Jose M. Framinan, Rafael Ruiz-Usano
openaire +1 more source
IEEE Transactions on Cybernetics, 2020
In this article, we propose a hybrid artificial bee colony (ABC) algorithm to solve a parallel batching distributed flow-shop problem (DFSP) with deteriorating jobs.
Jun-qing Li +6 more
semanticscholar +1 more source
In this article, we propose a hybrid artificial bee colony (ABC) algorithm to solve a parallel batching distributed flow-shop problem (DFSP) with deteriorating jobs.
Jun-qing Li +6 more
semanticscholar +1 more source