Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
S.M.T. Fatemi Ghomi
Information about the author S.M.T. Fatemi Ghomi will soon be added to the site.
Found
11 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept
2007
This paper presents a newly developed resource-constrained project scheduling method...
A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains
2006
In this paper, we investigate the lot and delivery scheduling problem in a simple...
A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over
2006
In this paper, the multi-item, single-level, capacitated, dynamic lot sizing problem...
A hybrid intelligent system for multiobjective decision making problems
2006
In attempt to solve multiobjective problems, many mathematical and stochastic methods...
The common cycle economic lot scheduling in flexible job shops: The finite horizon case
2005
This paper addresses the common cycle multi-product lot-scheduling problem in...
The capacitated lot sizing problem: a review of models and algorithms
2003
Lot sizing is one of the most important and also one of the most difficult problems in...
A new structural mechanism for reducibility of stochastic PERT networks
2003
In recent years, many techniques were developed to compute completion time...
Optimal control of service rates and arrivals in Jackson networks
2003
We can represent each dynamic job shop system as a network of queues, in which each...
Path critical index and activity critical index in PERT networks
2002
The criticality index of an activity is the probability that the activity is on the...
A simulation model for multi-project resource allocation
2002
There are limited solution techniques available for resource constrained single...
A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network
1999
An analytical algorithm is presented to compute the network completion time...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers