A branch-and-bound procedure to solve a bicriterion scheduling problem Article

Sen, T, Gupta, SK. (1983). A branch-and-bound procedure to solve a bicriterion scheduling problem . IIE TRANSACTIONS, 15(1), 84-88. 10.1080/05695558308974617

cited authors

  • Sen, T; Gupta, SK

authors

abstract

  • Most scheduling research is done with one criterion; however, the real-world situations demand consideration of multicriterion problems because there are generally many costs associated with scheduling decisions. This paper considers the problem of minimizing a linear combination of flow times and max- mum tardiness of a given number of jobs on a single machine and presents a branch-and-bound technique to arrive at an optimal solution. The computational results are also reported. © 1983 IIIE.

publication date

  • January 1, 1983

published in

Digital Object Identifier (DOI)

start page

  • 84

end page

  • 88

volume

  • 15

issue

  • 1