Title from caption. "April 1998."Includes bibliographical references (p. 26).Supported in part by the Air Force Office of Scientific Research F49620-97-C-0013by Dimitri P. Bertsekas and David A. Castañon
The purpose of this paper is to present examples for the sometimes surprisingly different behavior o...
This paper addresses the non-preemptive single machine scheduling problem to minimize total tardines...
The topic of this thesis are new approximation methods for job-shop scheduling that dispatch jobs ba...
Caption title.Includes bibliographical references (p. 11-12).Supported by NSF grant. 9625489-DMIby D...
Caption title.Includes bibliographical references (p. 19).Supported by a grant from NSF. DMI-9625489...
Scheduling policies for open soft real-time systems must be able to balance the competing concerns o...
Traditional job shop scheduling models ignore the stochastic elements that exist in actual job shops...
The Monte Carlo Rollout method (MCR) is a novel approach to solve combinatorial optimization problem...
A multi-armed bandit problem classically concerns N >= 2 populations of rewards whose statistical pr...
The purpose of this paper is to present examples for the sometimes surprisingly different behavior o...
The scope of this book is limited to heuristics, metaheuristics, and approximate methods and algorit...
The Sequential Stochastic Assignment Problem (SSAP) deals with assigning sequentially arriving tasks...
AbstractPractical scheduling problems require the consideration of random events that may effect pla...
We consider the stochastic identical parallel machine scheduling problem and its online extension, w...
Rollout methodology is a constructive metaheuristic algorithm and its main characteristics are its m...
The purpose of this paper is to present examples for the sometimes surprisingly different behavior o...
This paper addresses the non-preemptive single machine scheduling problem to minimize total tardines...
The topic of this thesis are new approximation methods for job-shop scheduling that dispatch jobs ba...
Caption title.Includes bibliographical references (p. 11-12).Supported by NSF grant. 9625489-DMIby D...
Caption title.Includes bibliographical references (p. 19).Supported by a grant from NSF. DMI-9625489...
Scheduling policies for open soft real-time systems must be able to balance the competing concerns o...
Traditional job shop scheduling models ignore the stochastic elements that exist in actual job shops...
The Monte Carlo Rollout method (MCR) is a novel approach to solve combinatorial optimization problem...
A multi-armed bandit problem classically concerns N >= 2 populations of rewards whose statistical pr...
The purpose of this paper is to present examples for the sometimes surprisingly different behavior o...
The scope of this book is limited to heuristics, metaheuristics, and approximate methods and algorit...
The Sequential Stochastic Assignment Problem (SSAP) deals with assigning sequentially arriving tasks...
AbstractPractical scheduling problems require the consideration of random events that may effect pla...
We consider the stochastic identical parallel machine scheduling problem and its online extension, w...
Rollout methodology is a constructive metaheuristic algorithm and its main characteristics are its m...
The purpose of this paper is to present examples for the sometimes surprisingly different behavior o...
This paper addresses the non-preemptive single machine scheduling problem to minimize total tardines...
The topic of this thesis are new approximation methods for job-shop scheduling that dispatch jobs ba...
DOI
Add to ORKG