Results 21 to 30 of about 161,061 (357)
Efficient heuristics for the parallel blocking flow shop scheduling problem [PDF]
, 2017 We consider the NP-hard problem of scheduling n jobs in F identical parallel flow shops, each consisting of a series of m machines, and doing so with a blocking constraint.
Companys Pascual, Ramón +2 more
core +2 more sources
Future Internet, 2017 This research combines between two different manufacturing concepts. On the one hand, flow shop scheduling is a well-known problem in production systems. The problem appears when a group of jobs shares the same processing sequence on two or more machines
Ahmed R. Sadik, Bodo Urban
doaj +1 more source
IEEE Access, 2020 Open shop scheduling problems have many practical applications, in which the jobs can be in any order with the only restriction that their durations do not overlap with each other. In some cases, the order of a subset of jobs dictates the flow shop model
Guanqun Ni, Lei Chen
doaj +1 more source
A New Multi-Objective Hybrid Flow Shop Scheduling Method to Fully Utilize the Residual Forging Heat
IEEE Access, 2020 This paper aims to solve the problem of high energy consumption in forging production through energy-saving scheduling. By analyzing the flow shop characteristics of a forging workshop, an energy-efficient hybrid flow shop scheduling problem with forging
Qiang Cheng +5 more
doaj +1 more source
Complex & Intelligent Systems, 2021 Distributed hybrid flow shop scheduling problem (DHFSP) has attracted some attention; however, DHFSP with uncertainty and energy-related element is seldom studied.
Jingcao Cai, Deming Lei
semanticscholar +1 more source
Application of genetic algorithm to industrial scheduling and problems of parameters evaluation
Lietuvos Matematikos Rinkinys, 2021 Genetic algorithms are widely used in various mathematical and real world problems. They are approximate metaheuristic algorithms, commonly used for solving NP-hard problems in combinatorial optimisation.
Edgaras Šakurovas +1 more
doaj +1 more source
Approximation algorithms for the parallel flow shop problem [PDF]
, 2012 We consider the NP-hard problem of scheduling n jobs in m two-stage parallel flow shops so as to minimize the makespan. This problem decomposes into two subproblems: assigning the jobs to parallel flow shops; and scheduling the jobs assigned to the same ...
Velde, S.L. (Steef) van de +1 more
core +2 more sources
Analysis of usage of genetic and tabu search algorithms in shop scheduling
Lietuvos Matematikos Rinkinys, 2008 A wide area of scheduling problem is industrial so-called shop scheduling (Job Shop, Flow Shop and Open Shop) which has important applications in real world industrial problems.
Edgaras Šakurovas +1 more
doaj +1 more source
, 2021 : This paper addresses the Energy-Aware Distributed Hybrid Flow Shop Scheduling Problem with Multiprocessor Tasks (EADHFSPMT) by considering two objectives simultaneously, i.e., makespan and total energy consumption.
Enda Jiang, Ling Wang, Jing-jing Wang
semanticscholar +1 more source
Cost approach to the flow-shop construction scheduling [PDF]
E3S Web of Conferences, 2019 A flow-shop construction scheduling – especially for a higher number of tasks projected – requires the use of metaheuristic algorithms to find the optimal schedule. The criteria of optimality may vary as well as constraints assumed for the schedule.
Anysz Hubert, Krzemiński Michał
doaj +1 more source