N jobs and m machines job-shop problems with sequence-dependent set-up times Article

Gupta, SK, Gupta, SK. (1982). N jobs and m machines job-shop problems with sequence-dependent set-up times . INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 20(5), 643-656. 10.1080/00207548208947793

cited authors

  • Gupta, SK; Gupta, SK

authors

abstract

  • This paper presents a mathematical model based on the branch-and-bound technique to solve static scheduling problems involving n jobs and m machines where the objective is to minimize the cost of setting up the machines. Set-up times are sequence dependent and not included in processing times. There is a finite non-zero cost associated with setting the machines which is different for each machine. It is further assumed that the routing may be different for different jobs and a job may return to a machine more than once. © 1982 Taylor and Francis Group, LLC.

publication date

  • January 1, 1982

published in

Digital Object Identifier (DOI)

start page

  • 643

end page

  • 656

volume

  • 20

issue

  • 5