Results 21 to 30 of about 87,422 (257)
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 Note on Heuristics of Flow-Shop Scheduling [PDF]
Operations Research, 1996 We present an O(mn) two-group (TG) heuristic for the m-machine, n-job permutation flow-shop scheduling problem. We show that heuristic TG has a worst-case performance ratio of (m + 1)/2. We also establish worst-case bounds for several heuristics proposed in the past.
openaire +2 more sources
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
Advances in Mechanical Engineering, 2021 The flow shop scheduling problem has been widely studied in recent years, but the research on multi-objective flow shop scheduling with green indicators is still relatively limited.
Wenbin Gu +3 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
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
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
An approximation algorithm for the three-machine scheduling problem with the routes given by the same partial order [PDF]
, 2014 The paper considers a three-machine shop scheduling problem to minimize the makespan, in which the route of a job should be feasible with respect to a machine precedence digraph with three nodes and one arc.
Quibell, Richard, Strusevich, Vitaly A.
core +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
Algorithms, 2014 Production processes in Cellular Manufacturing Systems (CMS) often involve groups of parts sharing the same technological requirements in terms of tooling and setup. The issue of scheduling such parts through a flow-shop production layout is known as the
Antonio Costa +2 more
doaj +1 more source