The shifting bottleneck procedure for job shop scheduling
Management Science
Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Group scheduling on two cells with intercell movement
Computers and Operations Research
Scheduling groups of unit length jobs on two identical parallel machines
Information Processing Letters
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Scatter Search: Methodology and Implementations in C
Scatter Search: Methodology and Implementations in C
Information Processing Letters
A simulated annealing algorithm for manufacturing cell formation problems
Expert Systems with Applications: An International Journal
Computers and Operations Research
Expert Systems with Applications: An International Journal
Genetic algorithm approach for solving a cell formation problem in cellular manufacturing
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Scheduling groups of jobs in the two-machine flow shop
Mathematical and Computer Modelling: An International Journal
Computers and Industrial Engineering
Scheduling Cellular Manufacturing Systems Using ACO and GA
International Journal of Applied Metaheuristic Computing
Dynamic parts scheduling in multiple job shop cells considering intercell moves and flexible routes
Computers and Operations Research
Hi-index | 12.05 |
This paper considers a group scheduling problem for manufacturing cells, in which parts may visit different cells. By addressing intra-cell scheduling, the sequence of parts within manufacturing cells is determined; however, in inter-cell scheduling the sequence of cells is obtained. We present a new mathematical model for a multi-criteria group scheduling problem in a cellular manufacture system (CMS). The main objective is to minimize the makespan, intracellular movement, tardiness, and sequence-dependent setup costs, simultaneously. Due the complexity to solve this problem, we develop a meta-heuristic algorithm based on scatter search (SS). This algorithm is evaluated and the related results confirm the efficiency and the effectiveness of our proposed SS to provide good solutions, especially for medium and large-sized problems.