A Note On Just-In-Time Scheduling On Flow Shop Machines

Abstract

In this paper, the scheduling to maximize the weighted number of Just-In-Time jobs is considered. This problem is known to be NP Complete for when the due date is at a point in time indicating no efficient optimal solution is feasible in reliable time. Due dates with interval in time are considered in this work. The problem formulation is suggested, two greedy heuristics are proposed for solving the problem. A numerical example to illustrate its use and extensive computational experiments performed with promising results are presented. Likely areas of extensions are provided.