Sciweavers

334 search results - page 2 / 67
» Time representations and mathematical models for process sch...
Sort
View
ICTCS
2001
Springer
13 years 9 months ago
Job Shop Scheduling Problems with Controllable Processing Times
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing t...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...
ICEIS
2003
IEEE
13 years 10 months ago
Live-Representation Process Management
Abstract: We present the live-representation approach for managing and working in complex, dynamic business processes. In this approach, aspects of business-process modeling, proje...
Daniel D. Corkill, Zachary B. Rubinstein, Susan E....
MICS
2010
77views more  MICS 2010»
13 years 3 months ago
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
George B. Mertzios, Walter Unger
ANOR
2011
214views more  ANOR 2011»
13 years 12 days ago
A hybrid constraint programming approach to the log-truck scheduling problem
Abstract. Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization te...
Nizar El Hachemi, Michel Gendreau, Louis-Martin Ro...
CCE
2008
13 years 5 months ago
Process scheduling under uncertainty: Review and challenges
Uncertainty is a very important concern in production scheduling since it can cause infeasibilities and production disturbances. Thus scheduling under uncertainty has received a l...
Zukui Li, Marianthi G. Ierapetritou