Sciweavers

Share
COR
2011
8 years 2 months ago
Time-constrained project scheduling with adjacent resources
We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with Adjacent Resources. For adjacent resources the resource units are ordered and th...
Johann Hurink, A. L. Kok, Jacob Jan Paulus, J. M. ...
ANOR
2011
214views more  ANOR 2011»
8 years 2 months 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...
EOR
2010
104views more  EOR 2010»
8 years 4 months ago
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül...
IPPS
2010
IEEE
8 years 5 months ago
On the importance of bandwidth control mechanisms for scheduling on large scale heterogeneous platforms
We study three scheduling problems (file redistribution, independent tasks scheduling and broadcasting) on large scale heterogeneous platforms under the Bounded Multi-port Model. I...
Olivier Beaumont, Hejer Rejeb
EOR
2002
105views more  EOR 2002»
8 years 7 months ago
Review of properties of different precedence graphs for scheduling problems
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
Jacek Blazewicz, Daniel Kobler
CCE
2004
8 years 7 months ago
Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review
An overview of developments in the scheduling of multiproduct/multipurpose batch and continuous processes is presented. Existing approaches are classified based on the time repres...
Christodoulos A. Floudas, Xiaoxia Lin
TASE
2008
IEEE
8 years 7 months ago
New Solution Approaches to the General Single- Machine Earliness-Tardiness Problem
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...
Hoksung Yau, Yunpeng Pan, Leyuan Shi
DAM
2007
91views more  DAM 2007»
8 years 7 months ago
A note on the precedence-constrained class sequencing problem
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...
José R. Correa, Samuel Fiorini, Nicol&aacut...
CPC
2006
73views more  CPC 2006»
8 years 7 months ago
Feasible Schedules for Rotating Transmissions
Motivated by a scheduling problem that arises in the study of optical networks we prove the following result, which is a variation of a conjecture of Haxell, Wilfong and Winkler. ...
Noga Alon
EOR
2010
104views more  EOR 2010»
8 years 7 months ago
Cut generation for an integrated employee timetabling and production scheduling problem
This paper investigates the integration of the employee timetabling and production scheduling problems. At the first level, we manage a classical employee timetabling problem. At ...
O. Guyon, P. Lemaire, Eric Pinson, David Rivreau
books