200 search results - page 6 / 40 » Job Shop Scheduling Problems with Controllable Processing Ti... |
EOR
2006
13 years 7 months ago
2006
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
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...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
ESA
2001
Springer
14 years 3 days ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
CSCLP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Overload checking, forbidden regions, edge finding, and notfirst/not-last detection are well-known propagation rules to prune the start times of activities which have t...