Minimizing the Range of Lateness for n-Jobs, 3-Machines Sequencing Problem with Due Date, Transportation Times and Equivalent Job for Block of Jobs – A Heuristic Approach Research

Abstract

Here a heuristic approached has been developed to minimize the range of lateness in sequencing problem of n-jobs,
3-machine with due-date and equivalent job for block of jobs. The approach is based on three theorems. This paper
investigates some conditions to be imposed on times transportation and processing times. Minimization of range of
lateness is the criterion to find optimal sequence of jobs. A rule to determine equivalent job and its processing times for
jobs in block has also been determined here. The work has been supported by a numerical example.