An application of effective genetic algorithms for Solving Hybrid Flow Shop Scheduling Problems [PDF]
International Journal of Computational Intelligence Systems, 2008 This paper addresses the Hybrid Flow Shop (HFS) scheduling problems to minimize the makespan value. In recent years, much attention is given to heuristic and search techniques.
Cengiz Kahraman +3 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]
Journal of Optimization in Industrial Engineering, 2016 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
Applied Sciences, 2023 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
A Novel Metaheuristics To Solve Mixed Shop Scheduling Problems
, 2013 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 Complexity of Mean Flow Time Scheduling Problems with Release Times
, 2006 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
A decomposition based algorithm for flexible flow shop scheduling with machine breakdown [PDF]
, 2009 Research on flow shop scheduling generally ignores uncertainties in real-world production because of the inherent difficulties of the problem. Scheduling problems with stochastic machine breakdown are difficult to solve optimally by a single approach ...
Choi, SH, Wang, K
core +1 more source
Robust multi-objective hybrid flow shop scheduling
Journal of Applied Research on Industrial Engineering, 2021 Scheduling is an important decision-making process that aims to allocate limited resources to the jobs in a production process. Among scheduling problems, Hybrid Flow Shop (HFS) scheduling has good adaptability with most real world applications including
Behnaz Zanjani +3 more
doaj +1 more source
A novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem [PDF]
, 2014 Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding,
Ghomi, S.M.T. Fatemi +2 more
core +1 more source
Selected heuristic algorithms for solving job shop and flow shop scheduling problems [PDF]
, 2014 Importance of job shop and flow shop scheduling has increased to a high extent. Nowadays, each and every industry focuses largely on how to schedule their machine working, since it is an important factor which decides the net productivity.
Das, M K
core
Heuristic for flow shop sequencing with separated and sequence independent setup times [PDF]
, 2011 This paper deals with the permutation flow shop scheduling problem with separated and sequence-independent machine setup times. A heuristic method with the objective of minimizing the total time to complete the schedule is introduced.
MOCCELLIN, João Vitor +1 more
core +2 more sources