200 search results - page 7 / 40 » Job Shop Scheduling Problems with Controllable Processing Ti... |
93
Voted
COR
2010
15 years 2 months ago
2010
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
129
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
109
Voted
AIPS
2009
15 years 3 months ago
2009
This paper considers Just-In-Time Job-Shop Scheduling, in which each activity has an earliness and a tardiness cost with respect to a due date. It proposes a constraint programmin...
97
Voted
COR
2008
15 years 2 months ago
2008
In many realistic situations, a job processed later consumes more time than the same job when it is processed earlier; this phenomenon is known as deteriorating jobs. However, job...
113
Voted
IEAAIE
2005
Springer
15 years 8 months ago
2005
Springer
When using a constructive search algorithm, solutions to scheduling problems such as the job shop and open shop scheduling problems are typically represented as permutations of the...