Results 31 to 40 of about 4,911,676 (214)
Rockfill dams are among the most complex, significant, and costly infrastructure projects of great national importance. A key issue in their design is the construction stage and zone optimization.
Jun Zhang +4 more
doaj +1 more source
Application of genetic algorithm to industrial scheduling and problems of parameters evaluation
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
Flow-shop problems with intermediate buffers [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brucker, Peter +2 more
openaire +2 more sources
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
A systematic literature review on energy-efficient hybrid flow shop scheduling
Scheduling problems should not only focus on minimizing completion time, but other performances, such as minimizing energy consumption, are urgent to investigate.
Dana Marsetiya Utama +4 more
doaj +1 more source
In this paper, we propose a formulation of the permutation flow and job shop scheduling problems using special recursive functions and show its equivalence to the existing classical formulation.
Boris Kupriyanov +3 more
doaj +1 more source
On Two-machine Flow Shop Scheduling [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Lin +2 more
openaire +2 more sources
An Effective Hybrid Genetic Algorithm for Hybrid Flow Shops with Sequence Dependent Setup Times and Processor Blocking [PDF]
Hybrid flow-shop or flexible flow shop problems have remained subject of intensive research over several years. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of ...
doaj
Permutation, no-wait, no-idle flow shop problems
The paper compares the schedules of different variants of the flow shop problem, i.e. permutation, no waiting and no idle flow shop problems. It is assessed the impact of the constraints on the extension of the schedules and correlations of the length of
Makuchowski Mariusz
doaj +1 more source
Inverse scheduling: two-machine flow-shop problem [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brucker, P, Shakhlevich, NV
openaire +3 more sources

