Repositorio de producción científica de la Universidad de Sevilla

Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

 

Advanced Search
 
Opened Access Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
Cites

Show item statistics
Icon
Export to
Author: Pérez González, Paz
Framiñán Torres, José Manuel
Department: Universidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas I
Date: 2009
Published in: Computers and Operations Research, 36(10), 2866-2876
Document type: Article
Abstract: In this paper, we address the problem of scheduling a set of jobs in a flowshop with makespan objective. In contrast to the usual assumption of machine availability presented in most research, we consider that machines may not be available at the beginning of the planning period, due to processing of previously scheduled jobs. We first formulate the problem, analyse the structure of solutions depending on a number of factors (such as machines, jobs, structure of the processing times, availability vectors, etc.), and compare it with its classical counterpart. Results indicate that the problem under consideration presents a different structure of solutions, and that it is easier than the classical permutation flowshop problem. In view of these results, we propose and test a number of fast heuristics for the problem.
Cite: Pérez González, P. y Framiñán Torres, J.M. (2009). Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics. Computers and Operations Research, 36 (10), 2866-2876.
Size: 830.7Kb
Format: PDF

URI: http://hdl.handle.net/11441/23451

DOI: 10.1016/j.cor.2008.12.018

See editor´s version
See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)