Note—Sequencing with Finite Intermediate Storage

This note presents procedures for finding optimal solutions to the deterministic N-job two machine flow-shop sequencing problem when the buffer size z is nearly the same as the number of jobs. When m = N − z − 2 is small, a simple and fast procedure that uses Johnson's algorithm on the middle N − 2m jobs is used. The procedure has a computational complexity of o(N 2m+1 ) comparisons.

• 저널Management Science · 23(2) · 216–217
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.23.2.216
• 저자S. S. Reddi