LSB 스케줄링기법의 소개

In industrial production setting scheduling problems of detalied day-to-day operations are often ordeals to production practitioners. For those who have scheduling experience with the Gantt Chart, the job oriented heuristic scheduling has illustrated its merits in solving practically large stale scheduling problems. It schedules all operations of a job within a finite capacity before considering the next job. This paper introduces a new LSB (load smoothing backward) scheduling algorithm for the job oriented heuristic scheduling. Through the computer simulation in a hypothetical setting, this paper provides a comparison of LSB scheduling with existing algorithms and a guideline for selecting the suitable algorithm for certain industrial setting.