Now showing items 1-5 of 5
Dynamic lot sizing and tool management in automated manufacturing systems
The overall aim of this study is to show that there is a critical interface between the lot sizing and tool management decisions, and these two problems cannot be viewed in isolation. We propose "ve alternative algorithms ...
The robust spanning tree problem with interval data
Motivated by telecommunications applications we investigate the minimum spanning tree problem where edge costs are interval numbers. Since minimum spanning trees depend on the realization of the edge costs, we de5ne the ...
Job shop scheduling with beam search
(Elsevier Science B.V., Amsterdam, Netherlands, 1999)
Beam Search is a heuristic method for solving optimization problems. It is an adaptation of the branch and bound method in which only some nodes are evaluated in the search tree. At any level, only the promising nodes are ...
A new dominance rule to minimize total weighted tardiness with unequal release dates
We present a new dominance rule by considering the time-dependent orderings between each pair of jobs for the single machine total weighted tardiness problem with release dates. The proposed dominance rule provides a ...
A polyhedral study of multiechelon lot sizing with intermediate demands
(Institute for Operations Research and the Management Sciences (I N F O R M S), 2012)
In this paper, we study a multiechelon uncapacitated lot-sizing problem in series (m-ULS), where the output of the intermediate echelons has its own external demand and is also an input to the next echelon. We propose a ...