An effective heuristic to JIT approach with controllable processing time

This study addresses the field of single machine scheduling problems with controllable processing times. In this area, it is often assumed that the possible processing time of a job can be continuously controlled, i.e. it can be any number in a given interval. The goal of this research is minimizing both total tardiness and earliness on a single machine problem, simultaneously. In this paper, a net benefit compression-net benefit expansion (NBC-NBE) heuristic is presented for obtaining the set of optimal amounts of compression and expansion of job processing times in a given sequence. This problem is NP-hard since the single machine total tardiness problem (SMTTP) is already NP-hard. The computational results show effectivity of our proposed heuristic for solving such Just-In-Time (JIT)problem.

کلیدواژه ها:

controllable processing time ، single machine ، earliness and tardiness