LSB algorithm for the job oriented heuristic scheduling

In industrial production settings, scheduling problems for detailed day-to-day operations are often ordeals to production practitioners. For those who have scheduling experiences with the Gantt Chart, the job oriented heuristic scheduling has illustrated its merits in solving practically large scale scheduling problems. It schedules all operations of a job within a finite capacity before considering the next job. In this paper, we introduce the LSB (load smoothing backward) scheduling algorithm for the job oriented heuristic scheduling. Through a computer experiment in a hypothetical setting, we make a performance comparison of LSB scheduling algorithm with existing algorithms and also suggest a guideline for selecting the suitable algorithm for certain industrial settings.