45 search results - page 2 / 9 » Variable Neighbourhood Search for Job Shop Scheduling Proble... |
KR
1992
Springer
13 years 11 months ago
1992
Springer
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
JAIR
2007
13 years 7 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
COR
2010
13 years 7 months ago
2010
The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a f...
CP
2005
Springer
14 years 1 months ago
2005
Springer
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
