Sciweavers

874 search results - page 58 / 175
» Optimal Scheduling of Contract Algorithms for Anytime Proble...
Sort
View
ANOR
2008
171views more  ANOR 2008»
14 years 10 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
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...
Christian Artigues, Dominique Feillet
ICC
2007
IEEE
168views Communications» more  ICC 2007»
15 years 4 months ago
Opportunistic Link Scheduling with QoS Requirements in Wireless Ad Hoc Networks
— 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...
Qing Chen, Qian Zhang, Zhisheng Niu
JCO
2000
116views more  JCO 2000»
14 years 9 months ago
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling
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...
Piotr Berman, Bhaskar DasGupta
CCE
2004
14 years 9 months ago
Cyclic short-term scheduling of multiproduct batch plants using continuous-time representation
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...
Dan Wu, Marianthi G. Ierapetritou
COR
2010
119views more  COR 2010»
14 years 10 months ago
Algorithms for a realistic variant of flowshop scheduling
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...
B. Naderi, Rubén Ruiz, M. Zandieh