Sciweavers

1719 search results - page 203 / 344
» Scheduling with soft constraints
Sort
View
123
Voted
ANOR
2008
171views more  ANOR 2008»
15 years 25 days 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
73
Voted
COR
2010
101views more  COR 2010»
15 years 24 days ago
Constraint-specific recovery network for solving airline recovery problems
In this paper, we consider the recovery of an airline schedule after an unforeseen event called disruption, making the planned schedule infeasible. We present a modeling framework...
Niklaus Eggenberg, Matteo Salani, Michel Bierlaire
122
Voted
RIDE
1998
IEEE
15 years 5 months ago
On Periodic Resource Scheduling for Continuous Media Databases
The Enhanced Pay-Per-View (EPPV) model for providing continuous-media services associates with each continuous-media clip a display frequency that depends on the clip's popula...
Minos N. Garofalakis, Banu Özden, Abraham Sil...
104
Voted
TASE
2008
IEEE
15 years 18 days ago
An Optimization-Based Approach for Design Project Scheduling
Concurrent engineering has been widely used in managing design projects to speed up the design process by concurrently performing multiple tasks. Since the progress of a design tas...
Ming Ni, Peter B. Luh, Bryan Moser
VLSISP
2002
112views more  VLSISP 2002»
15 years 10 days ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai