An exact algorithm for the precedence-constrained single-machine scheduling problem

@article{Tanaka2013AnEA,
  title={An exact algorithm for the precedence-constrained single-machine scheduling problem},
  author={Shunji Tanaka and Shun Sato},
  journal={European Journal of Operational Research},
  year={2013},
  volume={229},
  pages={345-352}
}
This study proposes an efficient exact algorithm for the precedence-constrained single-machine scheduling problem to minimize total job completion cost where machine idle time is forbidden. The proposed algorithm is based on the SSDP (Successive Sublimation Dynamic Programming) method and is an extension of the authors’ previous algorithms for the problem without precedence constraints. In this method, a lower bound is computed by solving a Lagrangian relaxation of the original problem via… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

Traveling Salesman Problem With a Drone Station

  • IEEE Transactions on Systems, Man, and Cybernetics: Systems
  • 2019

References

Publications referenced by this paper.
SHOWING 1-10 OF 32 REFERENCES

Similar Papers