An efficient algorithm for a job shop problem Academic Article uri icon

abstract

  • We study the problem of minimizing makespan in a two-machine job shop with unit processing time operations. An efficient algorithm with respect to a succinct encoding of the problem instances is proposed. The algorithm is an improvement of earlier algorithms proposed for the problem by Brucker [1,2], Hefetz and Adiri [7], and Timkovskiy [15]. The idea behind the algorithm has the potential of extension to job shops with parallel machines. © 1995 J.C. Baltzer AG, Science Publishers.

author list (cited authors)

  • Kubiak, W., Sethi, S., & Sriskandarajah, C.

citation count

  • 14

complete list of authors

  • Kubiak, Wieslaw||Sethi, Suresh||Sriskandarajah, Chelliah

publication date

  • December 1995