Sciweavers

908 search results - page 10 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
AIPS
2006
13 years 8 months ago
Lemma Reusing for SAT based Planning and Scheduling
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, K...
EOR
2010
104views more  EOR 2010»
13 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...
WSC
2007
13 years 9 months ago
Stochastic rollout and justification to solve the resource-constrained project scheduling problem
The key question addressed by the resource-constrained project scheduling problem (RCPSP) is to determine the start times for each activity such that precedence and resource const...
Ningxiong Xu, Linda K. Nozick, Orr Bernstein, Dean...
HEURISTICS
2002
152views more  HEURISTICS 2002»
13 years 7 months ago
A Constraint-Based Method for Project Scheduling with Time Windows
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
FLAIRS
1998
13 years 8 months ago
Discovering Heuristic Strategy for Solving Scheduling Problems
Optimallysolving a scheduling problemis computationally intractable, hencevarieties of techniques and methodshave been explored to obtain sub-optimal solutions to such problems. I...
Rasiah Loganantharaj