A genetic algorithm approach to designing and modelling of a multi-functional fractal manufacturing layout [PDF]
, 2013 A dynamic and optimal shop floor design, modelling and implementation is key to achieving successful Fractal Manufacturing System (FrMS). To build adaptive and fault-tolerant fractal layout, attention is paid to issues of shop floor planning, function ...
Aririguzo, Julian +2 more
core
Management of resources in multiunit construction projects with the use of a tabu search algorithm
Journal of Civil Engineering and Management, 2017 The paper presents the problem of optimal management of the resources in multiunit construction project. During the creation of the models of this kind of the project the flow-shop system is rarely used.
Michał Podolski
doaj +1 more source
Sequencing CONWIP flow-shops: Analysis and heuristics [PDF]
In this paper, we address the backlog sequencing problem in a flow-shop controlled by a CON\VIP production control system with the objective to minimise the make span We characterise the problem and analyse its similarities and differences with the ...
Framiúnan, Jose M. +2 more
core
Solving resource-constrained construction scheduling problems with overlaps by metaheuristic
Journal of Civil Engineering and Management, 2014 The paper concerns the problem of roadworks scheduling executed in the flow-shop system. Works may be performed parallelly with the acceleration (overlaps) of construction project, i.e.
Wojciech Bożejko +3 more
doaj +1 more source
Applying Machine Based Decomposition in 2-Machine Flow Shops [PDF]
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedure where a series of One Machine Sequencing Problems (OMSPs) are solved ...
Chatterjee Ashis K, Mukherjee, Saral
core
A GPU-accelerated Branch-and-Bound Algorithm for the Flow-Shop Scheduling Problem [PDF]
, 2012 Branch-and-Bound (B&B) algorithms are time intensive tree-based exploration methods for solving to optimality combinatorial optimization problems. In this paper, we investigate the use of GPU computing as a major complementary way to speed up those ...
Chakroun, Imen +3 more
core +5 more sources
Near-Optimal Heuristics for Just-In-Time Jobs Maximization in Flow Shop Scheduling
Algorithms, 2018 The number of just-in-time jobs maximization in a permutation flow shop scheduling problem is considered. A mixed integer linear programming model to represent the problem as well as solution approaches based on enumeration and constructive heuristics ...
Helio Yochihiro Fuchigami +2 more
doaj +1 more source
Innovative Optimization Algorithms for Large-Sized Industrial Scheduling Problems [PDF]
Brazilian Archives of Biology and TechnologyThe problem of minimizing total quadratic completion time in flow shops presents a significant challenge in industries such as chemical, metallurgical, and ceramic manufacturing.
Helio Yochihiro Fuchigami +1 more
doaj +1 more source
Efficient heuristics for the hybrid flow shop scheduling problem with missing operations [PDF]
, 2019 In this paper, we address the hybrid flowshop scheduling problem for makespan minimisation. More specifically, we are interested in the special case where there are missing operations, i.e.
Dios, Manuel +2 more
core
On non-permutation solutions to some two machine flow shop scheduling problems [PDF]
, 1994 In this paper, we study two versions of the two machine flow shop scheduling problem, where schedule length is to be minimized. First, we consider the two machine flow shop with setup, processing, and removal times separated.
Strusevich, V. (Vitaly) +1 more
core +2 more sources