Algorithms, 2014 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 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
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
Scheduling of re-entrant flow shops [PDF]
Journal of Operations Management, 1983 AbstractWe propose and develop a scheduling system for a very special type of flow shop. This flow shop processes a variety of jobs that are identical from a processing point of view. All jobs have the same routing over the facilities of the shop and require the same amount of processing time at each facility.
Stephen C. Graves +3 more
openaire +3 more sources
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
New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria [PDF]
, 2013 In this paper, we are interested in parallel identical machine scheduling problems with preemption and release dates in case of a regular criterion to be minimized.
Bellenguez-Morineau, O. +2 more
core +5 more sources
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 GPU-accelerated Branch-and-Bound Algorithm for the Flow-Shop Scheduling Problem [PDF]
, 2012 Branch-and-Bound (B&B) algorithms are time intensive tree-based exploration methods for solving to optimality combinatorial optimization problems. In this paper, we investigate the use of GPU computing as a major complementary way to speed up those ...
Chakroun, Imen +3 more
core +5 more sources
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