Results 261 to 270 of about 2,035,483 (294)

Transfer-robot task scheduling in flexible job shop

Journal of Intelligent Manufacturing, 2020
This paper studies a simultaneous scheduling of production and material transfer in a flexible job shop environment. The simultaneous scheduling approach has been recently adopted by a robotic mobile fulfillment system, wherein transbots pick up jobs and deliver to pick-stations for processing, which requires a simultaneous scheduling of jobs ...
openaire   +2 more sources

Adaptive representation for flexible job-shop scheduling and rescheduling

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, 2009
The flexible job-shop scheduling problem (FJSP) is one of the most popular scheduling problems, due to its relative simplicity, compared to real-world scheduling problems, and its NP-hardness. There are two types of decisions involved in solving FJSP problems: (1) assigning machines to operations, or routing, and (2) assigning a time slot in the ...
Prakarn Unachak, Erik D. Goodman
openaire   +2 more sources

Assignment and Scheduling in Flexible Job-Shops by Hierarchical Optimization

IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 2007
In this paper, we propose a new hierarchical method for the flexible job-shop scheduling problem (FJSP). This approach is mainly adapted to a job-shop problem (JSP) with high flexibility and is based on the decomposition of the problem in an assignment subproblem and a sequencing subproblem.
Nozha Zribi, Imed Kacem, Abdelkader El Kamel, Pierre Borne   +3 more
openaire   +3 more sources

Routing and scheduling in a flexible job shop by tabu search

Annals of Operations Research, 1993
A hierarchical algorithm for the flexible job shop scheduling problem is described, based on the tabu search metaheuristic. Hierarchical strategies have been proposed in the literature for complex scheduling problems, and the tabu search metaheuristic, being able to cope with different memory levels, provides a natural background for the development of
openaire   +3 more sources

Parallel hybrid metaheuristics for the flexible job shop problem

Computers & Industrial Engineering, 2010
A parallel approach to flexible job shop scheduling problem is presented in this paper. We propose two double-level parallel metaheuristic algorithms based on the new method of the neighborhood determination. Algorithms proposed here include two major modules: the machine selection module refer to executed sequentially, and the operation scheduling ...
Wojciech Bozejko, Mariusz Uchronski, Mieczyslaw Wodecki   +2 more
openaire   +2 more sources

Flexible Job-Shop Scheduling Problems

2005
Planning and scheduling problems in various industrial environments are combinatorial and very difficult. Generally, it is extremely hard to solve these types of problems in their general form. Scheduling can be formulated as a problem of determining the best sequence to execute a set of tasks on a set of resources, respecting specific constraints like
openaire   +2 more sources

Note to “Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm”

Journal of Intelligent Manufacturing, 2012
In this note, we show that there are some errors in the 0---1 integer programming model in recent paper [Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm 17 (2006) 493---507]. We point out these errors and correct them.
İŞLEYEN, SELÇUK KÜRŞAT, Demir, Yunus   +1 more
openaire   +2 more sources

Genetic algorithm for the flexible job-shop scheduling problem

SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483), 2004
In this paper, we are interested in the multiobjective optimization of the schedule performance in the flexible job shops. The flexible job shop scheduling problem (FJSP) is known in the literature as one of the hardest combinatorial optimization problems and presents many objectives to be optimized.
openaire   +2 more sources

Flexible Job-Shop Scheduling with Changeover Priorities

2022
Holden Milne, Opeyemi Adesina, Russell Campbell, Barbara Friesen, Masud Khawaja   +4 more
openaire   +2 more sources

A Hybrid PSO Applied to the Flexible Job Shop with Transport

2014
In this paper, we study the hybridization of particle swarm optimization (PSO) with stochastic local search. This hybrid metaheuristic is applied to a difficult scheduling problem, recently appeared in the literature, the flexible job shop problem with transport.
openaire   +2 more sources