WorldCat Identities

Herbots, Jade

Overview
Works: 8 works in 9 publications in 1 language and 10 library holdings
Roles: Author
Publication Timeline
.
Most widely held works by Jade Herbots
Experimental investigation of the applicability of ant colony optimization algorithms for project scheduling by Jade Herbots( Book )

2 editions published in 2004 in English and held by 3 WorldCat member libraries worldwide

Order acceptance and scheduling in a single-machine environment: exact and heuristic algorithms by Fabrice Talla Nobibon( )

1 edition published in 2009 in English and held by 1 WorldCat member library worldwide

Capacity allocation and downsizing decisions in project portfolio management by Jade Herbots( )

1 edition published in 2008 in English and held by 1 WorldCat member library worldwide

Efficient and effective solution procedures for order acceptance and capacity planning( )

1 edition published in 2007 in English and held by 1 WorldCat member library worldwide

Project portfolio management: capacity allocation, downsizing decisions and sequencing rules by Jade Herbots( )

1 edition published in 2008 in English and held by 1 WorldCat member library worldwide

Efficient and Effective Solution Procedures for Order Acceptance and Capacity Planning by Jade Herbots( )

1 edition published in 2008 in Undetermined and held by 1 WorldCat member library worldwide

This paper investigates dynamic order acceptance and capacity planning under limited regular and non-regular resources. Our goal is to maximize the profits of the accepted projects within a finite planning horizon. The way in which the projects are planned affects their payout time and, as a consequence, there investment revenues as well as the available capacity for future arriving projects. In general, project proposals arise dynamically to the organization, and their actual characteristics are only revealed upon arrival. Dynamic solution approaches are therefore most likely to obtain good results. Although the problem can theoretically be solved to optimality as a stochastic dynamic program, real-life problem instances are too difficult to be solved exactly within areas on able amount of time. Efficient and effective heuristics are thus required that supply a response without delay. For this reason, this paper considers both 'single-pass' algorithms as well as approximate dynamic-programming algorithms and investigates their suitability to solve the problem. Simulation experiments compare the performance of our procedures to a first-come, first-served policy that is commonly used in practice
Experimental investigation of the applicability of ant colony optimization algorithms for project scheduling by Jade Herbots( Book )

1 edition published in 2004 in English and held by 1 WorldCat member library worldwide

Dynamic order acceptance and capacity planning within a multi-project environment( )

1 edition published in 2006 in English and held by 1 WorldCat member library worldwide

 
Audience Level
0
Audience Level
1
  General Special  
Audience level: 0.00 (from 0.00 for Experiment ... to 0.00 for Experiment ...)

Languages