Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups Academic Article

abstract

• Minimization of the total completion time in two-machine group scheduling problems with sequence-dependent setups that are typically found in discrete parts manufacturing is discussed. Four different lower bounding mechanisms are developed to identify a lower bound for all problems attempted. And the largest of the four is aptly used in the evaluation of the percentage deviation of the search algorithms to assess their efficacy. The problem sizes are classified as small, medium and large, and to accommodate the variability that might exist in the sequence-dependent setup times on both machines.

authors

• Sriskandarajah, Chelliah

published proceedings

• Computers & Operations Research

author list (cited authors)

• Logendran, R., Salmasi, N., & Sriskandarajah, C.

citation count

• 45

complete list of authors

• Logendran, Rasaratnam||Salmasi, Nasser||Sriskandarajah, Chelliah

publication date

• January 2006

publisher

• Elsevier  Publisher

published in

• Computers and Operations Research  Journal

Digital Object Identifier (DOI)

• 10.1016/j.cor.2004.07.004

start page

• 158

end page

• 180

volume

• 33

issue

• 1

URL

• http://dx.doi.org/10.1016/j.cor.2004.07.004