Search
Now showing items 1-1 of 1
On the representation of the one machine sequencing problem in the shifting bottleneck heuristic
(2007-11-08)
The Shifting Bottleneck heuristic decomposes the Job Shop problem into a series of One Machine Sequencing Problems
(OMSPs) with release and due dates, precedence constraints and the minimization of maximum lateness ...