Job shop scheduling considering material handling

This paper compares the performance of two operations scheduling methods in a job shop environment. The first method, termed the truncated job shop sc heduling problem, represents a 'classical' approach to machine scheduling i n a job shop environment. The second method, termed the complete job shop s cheduling problem, explicitly considers material handling operations betwee n processing steps. Evidence that the complete job shop solution performs b etter under certain circumstances is presented.