874 search results - page 58 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
115
click to vote
ANOR
2008
15 years 20 hour ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
107
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper, we study the link layer scheduling problem in wireless ad hoc networks. In such a network, the communication links compete for the scarce and time-varying wirele...
JCO
2000
14 years 11 months ago
2000
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
CCE
2004
14 years 11 months ago
2004
The idea of cyclic scheduling is commonly utilized to address short-term scheduling problems for multiproduct batch plants under the assumption of relatively stable operations and...
COR
2010
15 years 1 hour ago
2010
This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and paralle...