114 search results - page 1 / 23 » On the Robust Single Machine Scheduling Problem |
JCO
2002
13 years 5 months ago
2002
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
EUSFLAT
2001
13 years 6 months ago
2001
A single machine scheduling problem with parameters given in the form of fuzzy numbers is considered. It is assumed that the optimal schedule in such a problem cannot be determine...
EOR
2010
13 years 2 months ago
2010
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...
EUSFLAT
2003
13 years 6 months ago
2003
A general formulation of the single machine scheduling problem with fuzzy parameters is proposed. Such notions as schedule, cost function and precedence relation are defined. The...