61 search results - page 2 / 13 » Planning and Scheduling to Minimize Tardiness |
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...
COR
2006
13 years 5 months ago
2006
In this paper the one-machine scheduling problem with linear earliness and tardiness costs is considered. The7 cost functions are job dependent and asymmetric. The problem consist...
COR
2011
2011
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
13 years 9 days ago
: In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-T...
ICDE
2009
IEEE
14 years 7 months ago
2009
IEEE
In highly interactive dynamic web database systems, user satisfaction determines their success. In such systems, userrequested web pages are dynamically created by executing a numb...
CLOUDCOM
2009
Springer
13 years 9 months ago
2009
Springer
Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent c...