Results 31 to 40 of about 468,839 (205)
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
A genetic algorithm for the mixed flow shop problem [PDF]
In this thesis we present a new interesting version of the mixed flow shop se-quencing problem, which at the same time is a version of the classic flow shop,a very common topic on operations research.We propose a genetic algorithm to solve it that we ...
Pascual Poch, Mario
core +1 more source
Card-based delivery date promising in pure flow shops with order release control [PDF]
Card-based systems are simple, effective means of controlling production. Yet most systems concentrate on controlling the shop floor. They neglect other planning tasks, like estimating short, feasible due dates during customer enquiry management.
Stevenson, Mark, Thurer, Matthias
core +1 more source
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
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
The Complexity of Mean Flow Time Scheduling Problems with Release Times
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time.
Baptiste, Philippe +5 more
core +3 more sources

