Fanjul Peyró, L.; Ruiz García, R. (2012). Scheduling unrelated parallel machines with optional machines and jobs selection. Computers and Operations Research. 39(7):1745-1753. doi:10.1016/j.cor.2011.10.012
Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/35335
Title:
|
Scheduling unrelated parallel machines with optional machines and jobs selection
|
Author:
|
Fanjul Peyró, Luis
Ruiz García, Rubén
|
UPV Unit:
|
Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat
Universitat Politècnica de València. Instituto Universitario Mixto Tecnológico de Informática - Institut Universitari Mixt Tecnològic d'Informàtica
|
Issued date:
|
|
Abstract:
|
[EN] In this paper we study two generalizations of the well known unrelated parallel machines scheduling problem under makespan (Cmax) minimization. First, a situation in which not every available parallel machine should ...[+]
[EN] In this paper we study two generalizations of the well known unrelated parallel machines scheduling problem under makespan (Cmax) minimization. First, a situation in which not every available parallel machine should be used and it is desirable to employ only a subset of the parallel machines. This is referred to as Not All Machines or NAM in short. This environment applies frequently in production shops where capacity exceeds demand or when production capacity can be lent to third companies. Also, NAM can be used to increase production capacity and it is not clear how many additional machines should be acquired. The second studied generalization has been referred to as Not All Jobs or NAJ. Here, there is no obligation to process all available jobs. We propose Mixed Integer Programming mathematical formulations for both NAM and NAJ, and it is shown that the latter can be effectively solved with modern commercial solvers. We also present three algorithms to solve the NAM problem. These algorithms are compared with the proposed MIP formulation when solved with IBM ILOG CPLEX 12.1. Comprehensive computational and statistical experiments prove that our proposed algorithms significantly improve the results given by the solver. © 2011 Elsevier Ltd. All rights reserved.
[-]
|
Subjects:
|
Job selection
,
Makespan
,
Not All Jobs
,
Not All Machines
,
Optional machines
,
Unrelated parallel machines
,
Scheduling algorithms
,
Integer programming
|
Copyrigths:
|
Reserva de todos los derechos
|
Source:
|
Computers and Operations Research. (issn:
0305-0548
)
|
DOI:
|
10.1016/j.cor.2011.10.012
|
Publisher:
|
Elsevier
|
Publisher version:
|
http://dx.doi.org/10.1016/j.cor.2011.10.012
|
Project ID:
|
MICINN/DPI2008-03511/DPI
IMPIVA/IMIDIC/2008/137
UPV/PPAR-3147
IMPIVA/IMIDIC/2009/198
IMPIVA/IMIDIC/2010/175
|
Thanks:
|
The authors would like to thank the anonymous referees for their careful and detailed comments which have helped to improve this manuscript considerably. This work is partially funded by the Spanish Ministry of Science and ...[+]
The authors would like to thank the anonymous referees for their careful and detailed comments which have helped to improve this manuscript considerably. This work is partially funded by the Spanish Ministry of Science and Innovation, under the project ‘‘SMPA—Advanced Parallel Multiobjective Sequencing: Practical and Theoretical Advances’’ with reference DPI2008-03511/DPI. The authors should also thank the IMPIVA—Institute for the Small and Medium Valencian Enterprise, under the project ‘‘OSC’’ with references IMIDIC/2008/137, IMIDIC/2009/198 and IMIDIC/2010/175 and the Polytechnic University of Valencia, under the project ‘‘PPAR— Production Programming in Highly Constrained Environments: New Algorithms and Computational Advances’’ with reference 3147.
[-]
|
Type:
|
Artículo
|