Treffer: Bi-objective resource-constrained project scheduling with robustness and makespan criteria

Title:
Bi-objective resource-constrained project scheduling with robustness and makespan criteria
Authors:
ABBASI, Babak, SHADROKH, Shahram, ARKAT, Jamal
Source:
Applied mathematics and computation. 180(1):146-152
Publisher Information:
New York, NY: Elsevier, 2006.
Publication Year:
2006
Physical Description:
print, 12 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Optimisation. Problèmes de recherche, Optimization. Search problems, Programmation mathématique, Mathematical programming, Ordonnancement, Scheduling, sequencing, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme numérique, Numerical algorithm, Algoritmo numérico, Mathématiques appliquées, Applied mathematics, Matemáticas aplicadas, Maximisation, Maximization, Maximización, Minimisation coût, Cost minimization, Minimización costo, Optimisation combinatoire, Combinatorial optimization, Optimización combinatoria, Optimum global, Global optimum, Optimo global, Problème NP difficile, NP hard problem, Problema NP duro, Programmation multiobjectif, Multiobjective programming, Programación multiobjetivo, Recuit simulé, Simulated annealing, Recocido simulado, Temps total achèvement, Makespan, Tiempo total acabamiento, Ordonnancement projet ressource contraint, Resource-constrained project scheduling, Ordonnancement robuste, Robust scheduling, multi objective combinatorial optimization
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Department of Industrial Engineering, Sharif University of Technology, P.O. Box 11365-9414, Azadi Avenue, Tehran, Iran, Islamic Republic of
Department of Industrial Engineering, Iran University of Science and Technology, Iran, Islamic Republic of
ISSN:
0096-3003
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18357066
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Operational research. Management
Accession Number:
edscal.18357066
Database:
PASCAL Archive

Weitere Informationen

Resource-constrained project scheduling problem (RCPSP) is one of the most important problems in the context of project scheduling. Considering a single objective, such as makespan minimization, net present value minimization or cost minimization has been the cornerstone of most studies done so far. At the other hand, taking this problem into account as a multi objective one has not been well studied. In this paper, a bi-objective model of RCPSP is presented. The first objective is makespan to be minimized, and the second one, a recently developed measure, is robustness maximization aimed at floating time maximization to make scheduling more reliable. The problem formed in this way is an NP-hard one forcing us to use simulated annealing algorithm to obtain a global optimum solution or at least a satisfying one. Finally, we have illustrated our new algorithm using a numerical example with different weights for robustness. (As an example, when robustness weight is zero, the problem will be solved as a makespan objective.).