Results 31 to 40 of about 85,049 (338)
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
Cost approach to the flow-shop construction scheduling [PDF]
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
A Note on Heuristics of Flow-Shop Scheduling [PDF]
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 +3 more sources
An approximation algorithm for the three-machine scheduling problem with the routes given by the same partial order [PDF]
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
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
New Heuristic Algorithm for Flow Shop Scheduling with 3 Machines and 2 Robots Considering the Breakdown Interval of Machines and Robots Simultaneously [PDF]
Scheduling is an important subject of production and operations management area. In flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria.
mahdi eghbali+2 more
doaj +1 more source
Solving the Distributed Permutation Flow-Shop Scheduling Problem Using Constrained Programming
The permutation flow-shop scheduling problem is a classical problem in scheduling that aims at identifying the optimal sequence of jobs that should be processed in a number of machines in an effort to minimize makespan or some other performance criterion.
Christos Gogos
doaj +1 more source
Flow shop scheduling with heterogeneous workers
We propose an extension to the flow shop scheduling problem named Heterogeneous Flow Shop Scheduling Problem (Het-FSSP), where two simultaneous issues have to be resolved: finding the best worker assignment to the workstations, and solving the corresponding scheduling problem. This problem is motivated by Sheltered Work centers for Disabled, whose main
Benavides, Alexander J.+2 more
openaire +2 more sources
A Novel Metaheuristics To Solve Mixed Shop Scheduling Problems
This paper represents the metaheuristics proposed for solving a class of Shop Scheduling problem. The Bacterial Foraging Optimization algorithm is featured with Ant Colony Optimization algorithm and proposed as a natural inspired computing approach to ...
Ravibabu, V.
core +1 more source
The Dominance Flow Shop Scheduling Problem
Fil: Rossit, Daniel Alejandro. Consejo Nacional de Investigaciones Cientificas y Tecnicas. Centro Cientifico Tecnologico Conicet - Bahia Blanca. Instituto de Matematica Bahia Blanca. Universidad Nacional del Sur. Departamento de Matematica.
Rossit, Daniel Alejandro+4 more
openaire +3 more sources