Salah E. Elmaghraby

From MaRDI portal
Person:177840

Available identifiers

zbMath Open elmaghraby.salah-eMaRDI QIDQ177840

List of research outcomes





PublicationDate of PublicationType
An Approach to Linear Programming under Uncertainty2019-06-03Paper
Project bidding under deterministic and probabilistic activity durations2018-07-19Paper
The scheduling of activities to maximize the net present value of projects2018-07-19Paper
https://portal.mardi4nfdi.de/entity/Q29329382014-12-09Paper
Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop2009-11-17Paper
Mathematical programming and financial objectives for scheduling projects2007-05-15Paper
On the fallacy of averages in project risk management2005-04-21Paper
Sequencing a hybrid two-stage flowshop with dedicated machines2003-10-13Paper
Allocation under uncertainty when the demand has continuous d. f2002-10-22Paper
Chance-constrained programming in activity networks: A critical evaluation2002-09-03Paper
On criticality and sensitivity in activity networks2002-08-19Paper
On computing the distribution function of the sum of independent random variables2001-12-10Paper
The economic lot scheduling problem under power-of-two policy2001-11-12Paper
Call admission control schemes and ATM network topological design2000-06-14Paper
A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan1999-08-02Paper
Optimal procedures for the discrete time/cost trade-off problem in project networks1998-11-29Paper
DAGEN: A generator of testsets for project activity nets1998-10-07Paper
Activity nets: A guided tour through some recent developments1998-06-11Paper
An Approach to the Modeling and Analysis of Software Production Processes1997-01-15Paper
Resource allocation via dynamic programming in activity networks1993-06-29Paper
The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)1993-01-12Paper
https://portal.mardi4nfdi.de/entity/Q31976071990-01-01Paper
Quality assurance and stage dynamics in multi-stage manufacturing. Part II1990-01-01Paper
Optimal control of the southern pine bettle (SPB) infestation1990-01-01Paper
On heuristics and their performance evaluation for dynamic lot sizing1989-01-01Paper
The knapsack problem with generalized upper bounds1989-01-01Paper
Approximating the Criticality Indices of the Activities in PERT Networks1985-01-01Paper
On the reduction method for integer linear programs. II1985-01-01Paper
Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines1984-01-01Paper
On the measurement of complexity in activity networks1980-01-01Paper
Optimal project compression with due-dated events1979-01-01Paper
Some operations research approaches to automobile gear train design1979-01-01Paper
The Economic Lot Scheduling Problem (ELSP): Review and Extensions1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41665681977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47729591973-01-01Paper
Optimal Time-Cost Trade-Offs in GERT Networks1972-01-01Paper
Optimization of Batch Ordering under Deterministic Variable Demand1972-01-01Paper
On Hyperbolic Programming with a Single Constraint and Upper-Bounded Variables1972-01-01Paper
Note—On the Sequencing of n Jobs on One Machine to Minimize the Number of Jobs Late1972-01-01Paper
A graph theoretic interpretation of the sufficiency conditions for the contiguous-binary-switching (CBS)-rule1971-01-01Paper
Rejoinder1971-01-01Paper
The Theory of Networks and Management Science. Part I1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55912691970-01-01Paper
The concept of state in discrete dynamic programming1970-01-01Paper
The Theory of Networks and Management Science. Part I1970-01-01Paper
The sequencing of “related” jobs1968-01-01Paper
On the Expected Duration of PERT Type Networks1967-01-01Paper
Sensitivity Analysis of Multiterminal Flow Networks1964-01-01Paper
On the dynamic programming approach to the 'caterer' problem1964-01-01Paper
On the relationship between the cut-tree and the fundamental cut-set of multi-terminal flow networks1964-01-01Paper
A Note on the “Explosion” and “Netting” Problems in the Planning of Materials Requirements1963-01-01Paper
A Single-Sample Multiple-Decision Procedure for Selecting the Multinomial Event Which Has the Highest Probability1959-01-01Paper

Research outcomes over time

This page was built for person: Salah E. Elmaghraby