Abstract
An iterative decomposition procedure is present for the job shop scheduling problem with minimizing the total weight tardiness. The method divides a given instance into a number of subproblems iteratively, each of which corresponds to a time window. Each subproblem with global performance is iteratively constructed and solved simultaneously with a heuristic branch and bound algorithm in a rolling horizon scheme. Numerical computational results indicate that the proposed method is effective and outperforms the rolling horizon procedure and some dispatching rules.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call