Results 1  10
of
33
On project scheduling with irregular starting time costs
, 2001
"... Maniezzo and Mingozzi (Oper.Res Lett. 25 (1999) 175182) study a project scheduling problem with irregular starting time costs. Starting from the assumption that its computational complexity sompl is open, they develop a branchandbound procedure and they identifysentif cast that aresej7xx# in pol ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Maniezzo and Mingozzi (Oper.Res Lett. 25 (1999) 175182) study a project scheduling problem with irregular starting time costs. Starting from the assumption that its computational complexity sompl is open, they develop a branchandbound procedure and they identifysentif cast that aresej7xx# in polynomial time. In this note, we pres;I a collection of previousk esviouskx resiou whichsic that the general problemis sblemj in polynomial time. This collection maysyjas ausExE guide to the literature, site this polynomialtimeslynomial has beenredis7E7jk7 in different contexts orus# different methods In addition, we briefly reviews vi related rested forsjxJJ7Ejk7#T#x and generalizations of the problem.
New DistanceDirected Algorithms for Maximum Flow and Parametric Maximum Flow Problems
, 1987
"... ..."
A Scatter Search Algorithm for Project Scheduling under Partially Renewable Resources
 Journal of Heuristics
, 2006
"... In this paper we develop a heuristic algorithm, based on Scatter Search, for project scheduling problems under partially renewable resources. This new type of resource can be viewed as a generalization of renewable and nonrenewable resources, and is very helpful in modelling conditions that do no f ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
(Show Context)
In this paper we develop a heuristic algorithm, based on Scatter Search, for project scheduling problems under partially renewable resources. This new type of resource can be viewed as a generalization of renewable and nonrenewable resources, and is very helpful in modelling conditions that do no fit into classical models, but which appear in real timetabling and labor scheduling problems. The Scatter Search algorithm is tested on existing test instances and obtains the best results known so far.
FLEXIBLE MODELING OF LINEAR SCHEDULES FOR INTEGRATED MATHEMATICAL ANALYSIS
"... Developing and analyzing schedules is essential for successfully controlling the time aspect of construction projects. The critical path method of scheduling is by far the most widely use scheduling technique in the construction industry. However, several problems related to its concept and use have ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Developing and analyzing schedules is essential for successfully controlling the time aspect of construction projects. The critical path method of scheduling is by far the most widely use scheduling technique in the construction industry. However, several problems related to its concept and use have been identified in the literature. The lesser known linear scheduling method has much potential for handling the rich information that project managers handle on a daily basis. While being wellsuited to linear and repetitive projects, it has been a predominantly graphical method without a comprehensive underlying mathematical model. This paper introduces a new method based on singularity functions using Macaulay bracket notation. It makes beneficial use of the strengths of these functions, including their flexibility and clarity, while remaining intuitive and requiring only basic geometry and algebra knowledge from users. An example from the literature is reanalyzed stepbystep and compared successfully with the critical path method. 1
GRASP and Path Relinking for Project Scheduling under Partially Renewable Resources
"... Recently, in the field of project scheduling problems the concept of partially renewable resources has been introduced. Theoretically, it is a generalization of both renewable and nonrenewable resources. From an applied point of view, partially renewable resources allow us to model a large variety ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
Recently, in the field of project scheduling problems the concept of partially renewable resources has been introduced. Theoretically, it is a generalization of both renewable and nonrenewable resources. From an applied point of view, partially renewable resources allow us to model a large variety of situations that do not fit in classical models, but can be found in real problems in timetabling and labor scheduling. In this paper we develop some preprocessing techniques and several heuristic algorithms for the problem. Preprocessing significantly reduces the dimension of the problems, therefore improving the efficiency of solution procedures. Heuristic algorithms based on GRASP and Path relinking are then developed and tested on existing test instances, obtaining excellent results.
Coordination and incentive contracts in project management under asymmetric information
, 2005
"... We study the problem of the manager of a project consisting of two subprojects or tasks which are outsourced to different subcontractors. The project manager earns more revenue from the project if it is completed faster, but he cannot observe how hard subcontractors work, only the stochastic durati ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We study the problem of the manager of a project consisting of two subprojects or tasks which are outsourced to different subcontractors. The project manager earns more revenue from the project if it is completed faster, but he cannot observe how hard subcontractors work, only the stochastic duration of their tasks. We derive the optimal linear incentive contracts to offer to the subcontractors when the tasks are conducted in series or in parallel. We compare them to the fixedprice contracts often encountered in practice, and discuss when incentive contracts lead to bigger performance improvement. We characterize how the incentive contracts vary with the subcontractors ’ risk aversion and cost of effort, the marginal effect of subcontractor effort, and the variability of task durations. We find that this dependence is sometimes counterintuitive in nature. For instance, for parallel tasks, if the first agent’s task is on the critical path and his variability increases, the project manager should induce the first agent to work less hard and the second agent to work harder.
Three Drexel Information Science Research Studies
, 1967
"... AND ITS APPLICATION TO BIOMEDICAL LITERATURE F. Lunin . . . . . . 47 I ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
AND ITS APPLICATION TO BIOMEDICAL LITERATURE F. Lunin . . . . . . 47 I
Pattern Graphs: A KnowledgeBased Tool for Multivariate Temporal Pattern Retrieval
"... Abstract—We introduce a new, powerful query formulation formalism for complex, multivariate sequence data. The new query language, termed pattern graphs, is capable of reflecting more aspects of temporal patterns than earlier proposals. The underlying graph structure of the pattern graph makes the q ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Abstract—We introduce a new, powerful query formulation formalism for complex, multivariate sequence data. The new query language, termed pattern graphs, is capable of reflecting more aspects of temporal patterns than earlier proposals. The underlying graph structure of the pattern graph makes the query intuitive to use and therefore understandable not only for the data analyst. We present algorithms to match patterns against data and demonstrate its usefulness on real data from the automobile industry. I.
Agile science operations: A new approach for primitive bodies exploration
"... Trojan Tour and Rendezvous would challenge traditional operations practices. Earthbased observations would provide only basic understanding before arrival and many science goals would be defined during the initial rendezvous. It could be necessary to revise trajectories and observation plans to qui ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Trojan Tour and Rendezvous would challenge traditional operations practices. Earthbased observations would provide only basic understanding before arrival and many science goals would be defined during the initial rendezvous. It could be necessary to revise trajectories and observation plans to quickly characterize the target for safe, effective observations. Detection of outgassing activity and monitoring of comet surface activity would be even more time constrained, with events occurring faster than roundtrip light time. "Agile science operations " would address these challenges with contingency plans that recognize the intrinsic uncertainty in the operating environment and science objectives. Planning for multiple alternatives could significantly improve the time required to repair and validate spacecraft command sequences. When appropriate, timecritical decisions could be automated and shifted to the spacecraft for immediate access to instrument data. Mirrored planning systems on both sides of the lighttime gap would permit transfer of authority back and forth as needed. We survey relevant science objectives, identifying time bottlenecks and the techniques that could be used to speed missions ' reaction to new science data. Finally, we discuss the results of a trade study simulating agile observations during flyby and comet rendezvous scenarios. These experiments quantify instrument coverage of key surface features as a function of planning turnaround time. Careful application of agile operations techniques could play a significant role in realizing the Decadal Survey recommendations for primitive body exploration. F I.
SOLVING STOCHASTIC PERT NETWORKS EXACTLY USING HYBRID BAYESIAN NETWORKS
"... In this paper, we describe how a stochastic PERT network can be formulated as a Bayesian network. We approximate such PERT Bayesian network by mixtures of Gaussians hybrid Bayesian networks. Since there exists algorithms for solving mixtures of Gaussians hybrid Bayesian networks exactly, we can use ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
In this paper, we describe how a stochastic PERT network can be formulated as a Bayesian network. We approximate such PERT Bayesian network by mixtures of Gaussians hybrid Bayesian networks. Since there exists algorithms for solving mixtures of Gaussians hybrid Bayesian networks exactly, we can use these algorithms to make inferences in PERT Bayesian networks. 1