نتایج جستجو برای: a multi mode resource constrained

تعداد نتایج: 13606733  

2008
CHING-CHIH TSENG

Many studies on the resource-constrained project-scheduling problem have been published, but literature further considering multi-mode or multi-project issues often occurring in the real world is rather scarce. In this research, two heuristic algorithms are developed to solve a multi-mode resource-constrained multi-project scheduling problem (MMRCMPSP). The first, a parallel scheduling algorith...

Journal: :مهندسی صنایع 0
جعفر باقری نژاد استادیار دانشکده مهندسی صنایع - دانشگاه الزهرا (س) فریبرز جولای استاد دانشکده مهندسی صنایع -پردیس دانشکده های فنی-دانشگاه تهران زهرا رفیعی مجد کارشناس ارشد مهندسی صنایع - دانشگاه الزهرا (س)

in this study, we present a mrcpsp/max (multi-mode resource-constrained project scheduling problem with minimum and maximum time lags) model with minimization tardiness costs and maximization earliness rewards of activities as objective. the proposed model is nearby to real-world problems and has wide applications in various projects. this problem is not available in the literature exactly and ...

Mohammad Reza Abassi Mohsen Garmsiri

In project scheduling, many problems can arise when resource fluctuations are beyond acceptable limits. To overcome this, mathematical techniques have been developed for leveling resources. However, these produce a hard and inflexible approach in scheduling projects. The authors propose a simple resource leveling approach that can be used in scheduling projects with multi-mode execution activit...

2012
Zahra Zare Abdulreza Naddaf Maysam Ashrafzadeh Mohammad Reza Salehi

Preemption in multi-mode Resource-constrained project scheduling problem Zahra Zare* Department of Industrial Engineering Najafabad Branch, Islamic Azad University, Isfahan, Iran Postal Code: 71767-13763, Unit 3, No 142, 6 Alley, South Bahonar St., Shiraz, Iran Abdulreza Naddaf Department of Management Shiraz University, Shiraz, Iran Maysam Ashrafzadeh Department of Industrial Engineering Najaf...

Journal: :Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 2006
Antonio Luis Lova María Pilar Tormos Federico Barber

This work deals with the multi-mode resource-constrained project scheduling problem. In this problem, activities of the project may be executed in more than one operating mode and renewable resource constraints exist. Each activity operation mode has a different duration and requires different amount of renewable resources. The objective function considered is the minimisation of the project co...

1997
RAINER KOLISCH ANDREAS DREXL

This paper addresses a general class of nonpreemptive resource-constrained project scheduling problems in which activity durations are discrete functions of committed renewable and nonrenewable resources. We provide a well known 0±1 problem formulation and stress the importance of themodel by giving applications within production and operationsmanagement. Furthermore, we prove that the feasibil...

Journal: :Appl. Soft Comput. 2012
Siamak Baradaran Seyyed M. T. Fatemi Ghomi Mohammad Ranjbar S. S. Hashemin

This paper presents a hybrid metaheuristic algorithm (HMA) for Multi-Mode Resource-Constrained Project Scheduling Problem (MRCPSP) in PERT networks. A PERT-type project, where activities require resources of various types with random duration, is considered. Each activity can be accomplished in one of several execution modes and each execution mode represents an alternative combination of resou...

2013
José Coelho Mario Vanhoucke

This chapter reports on a new solution approach for the multi-mode resource-constrained project scheduling problem (MRCPSP, MPS|prec|Cmax). This problem type aims at the selection of a single activity mode from a set of available modes in order to construct a precedence and a (renewable and non-renewable) resource-feasible project schedule with a minimal makespan. The problem type is known to b...

Journal: :CoRR 2013
Martin Josef Geiger

The resource constrained multi-mode multi-project scheduling problem (RCMMMPSP) is a notoriously difficult combinatorial optimization problem. For a given set of activities, feasible execution mode assignments and execution starting times must be found such that some optimization function, e. g. the makespan, is optimized. When determining an optimal (or at least feasible) assignment of decisio...

Journal: :European Journal of Operational Research 2015
Umut Besikci Ümit Bilge Gündüz Ulusoy

This paper introduces a multi-project problem environment which involves multiple projects with assigned due dates; activities that have alternative resource usage modes; a resource dedication policy that does not allow sharing of resources among projects throughout the planning horizon; and a total budget. Three issues arise when investigating this multi-project environment. First, the total b...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید