The distributed permutation flowshop scheduling problem

Authors:
B. Naderi;Rubén Ruiz
Affiliations:
Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, Tehran, Iran;Grupo de Sistemas de Optimización Aplicada, Instituto Tecnológico de Informática (ITI), Ciudad Politécnica de la Innovación, Edificio 8G, Acceso B, Universidad Polité ...
Venue:
Computers and Operations Research
Year:
2010

Citing 10
Cited 2

A genetic algorithm for flowshop sequencing

Computers and Operations Research - Special issue on genetic algorithms
Variable neighborhood search

Computers and Operations Research
Integrated process planning and scheduling with minimizing total tardiness in multi-plants supply chain

Computers and Industrial Engineering - Supply chain management
A very fast Tabu search algorithm for the permutation flow shop problem with makespan criterion

Computers and Operations Research
Process Planning and Scheduling for Distributed Manufacturing (Springer Series in Advanced Manufacturing)

Process Planning and Scheduling for Distributed Manufacturing (Springer Series in Advanced Manufacturing)
Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics

Computers and Operations Research
Modeling realistic hybrid flexible flowshop scheduling problems

Computers and Operations Research
An improved NEH-based heuristic for the permutation flowshop problem

Computers and Operations Research
A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem

INFORMS Journal on Computing
An adaptive genetic algorithm with dominated genes for distributed scheduling problems

Expert Systems with Applications: An International Journal

The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine

Information Sciences: an International Journal
Minimizing the total completion time in a distributed two stage assembly system with setup times

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPFSP. Under this generalization, we assume that there are a total of F identical factories or shops, each one with m machines disposed in series. A set of n available jobs have to be distributed among the F factories and then a processing sequence has to be derived for the jobs assigned to each factory. The optimization criterion is the minimization of the maximum completion time or makespan among the factories. This production setting is necessary in today's decentralized and globalized economy where several production centers might be available for a firm. We characterize the DPFSP and propose six different alternative mixed integer linear programming (MILP) models that are carefully and statistically analyzed for performance. We also propose two simple factory assignment rules together with 14 heuristics based on dispatching rules, effective constructive heuristics and variable neighborhood descent methods. A comprehensive computational and statistical analysis is conducted in order to analyze the performance of the proposed methods.