Keyword: networks: scheduling

Found 220 papers in total
Scheduling under due date assignment
Scheduling under due date assignment
2004,
A survey of scheduling methods is given for the problems where due dates, in contrast...
Complexity of optimal scheduling fixed number of jobs in multi-stage systems
Complexity of optimal scheduling fixed number of jobs in multi-stage systems
2004,
The paper surveys the complexity of job shop, flow shop, open shop and mixed shop...
Dynamic staffing in a telephone call center aiming to immediately answer calls
Dynamic staffing in a telephone call center aiming to immediately answer calls
1999,
This paper proposes practical modeling and analysis methods to facilitate dynamic...
Iterative converging algorithms for computing bounds on durations of activities in Pert and Pert-like models
Iterative converging algorithms for computing bounds on durations of activities in Pert and Pert-like models
2003,
Since its invention in 1958, Program Evaluation and Review Technique (PERT) has been...
Time–cost trade off in critical path method networks by simulated annealing
Time–cost trade off in critical path method networks by simulated annealing
2001,
In this paper a simulated annealing algorithm for time–cost trade off in CPM...
Activity time–cost tradeoffs under time and cost chance constraints
Activity time–cost tradeoffs under time and cost chance constraints
2003,
We describe a stochastic extension of the critical path method time–cost...
A network model for airline cabin crew scheduling
A network model for airline cabin crew scheduling
2002,
Airline crew scheduling problems have been traditionally formulated as set covering...
Composite variable formulations for express shipment service network design
Composite variable formulations for express shipment service network design
2002,
In this paper we describe a new approach to solving the express shipment service...
A second order stochastic network equilibrium model, II: Solution method and numerical experiments
A second order stochastic network equilibrium model, II: Solution method and numerical experiments
2002,
Real traffic networks typically exhibit considerable day-to-day variations in traffic...
A new optimization algorithm for the time–cost project network
A new optimization algorithm for the time–cost project network
2001,
We point out that the usual algorithm for the time–cost project network is not...
Algorithms of optimal supply of resources to a group of projects (stochastic networks)
Algorithms of optimal supply of resources to a group of projects (stochastic networks)
2001,
Several concurrently realized PERT -like network projects with random lengths of their...
Project scheduling with multiple modes: A comparison of exact algorithms
Project scheduling with multiple modes: A comparison of exact algorithms
1998,
This paper is devoted to a comparison of all available branch-and-bound algorithms...
Semi on-line algorithms for the partition problem
Semi on-line algorithms for the partition problem
1997,
The partition problem is one of the basic NP-complete problems. While an efficient...
A high-performance exact method for the resource-constrained project scheduling problem
A high-performance exact method for the resource-constrained project scheduling problem
2001,
This paper describes an efficient exact algorithm for project scheduling with resource...
Tools for resource-constrained project scheduling and control: forward and backward slack analysis
Tools for resource-constrained project scheduling and control: forward and backward slack analysis
2001,
Project managers generally consider slack as a measure of the scheduling flexibility...
An algorithm for seeking the critical paths in the overall planning graph
An algorithm for seeking the critical paths in the overall planning graph
2000,
An algorithm is presented for seeking the critical paths in the overall planning...
Job shop scheduling with two jobs and nonregular objective functions
Job shop scheduling with two jobs and nonregular objective functions
2001,
We consider the job shop scheduling problem with two jobs. We consider a broad class...
A variant selection problem for a generalized decision network
A variant selection problem for a generalized decision network
2001,
The problem of alternative selection of a variant is one of the main problems of...
An algorithm for selection of the most critical path in a project network
An algorithm for selection of the most critical path in a project network
2000,
This paper studies the ‘most critical path’ problem in a fuzzy project...
Local search algorithms for the multiprocessor flow shop scheduling problem
Local search algorithms for the multiprocessor flow shop scheduling problem
2001,
The multiprocessor flow shop scheduling problem is a generalization of the ordinary...
A fuzzy Hopfield–Tank traveling salesman problem model
A fuzzy Hopfield–Tank traveling salesman problem model
1999,
This article describes a Hopfield–Tank model of the Euclidean traveling salesman...
Worst-case performance of two critical path type algorithms
Worst-case performance of two critical path type algorithms
2000,
The critical path method remains one of the most popular approaches in practical...
Towards realism in network simulation
Towards realism in network simulation
1999,
The use of networks handling uncertainty to provide a temporal risk analysis of...
Synchronous unpaced flow lines with worker differences and overtime cost
Synchronous unpaced flow lines with worker differences and overtime cost
2000,
In this paper, we consider the design of a synchronous, unpaced flow line where...
Papers per page: