JUST-IN-TIME SCHEDULING PROBLEMS ON IDENTICAL PARALLEL MACHINES
Problems involving Just-In-Time (JIT) scheduling provide an interesting and difficult challenge, which is addressed critically within this paper. This study considers the scheduling of parallelidentical machines to maximize the (weighted) number of on-time jobs. This problem is known to be NP-complete. Three problems were dealt with in this paper. Two greedy heuristics with time complexity O(n log...