An algorithm for minimizing flow time and maximum earliness on a single machine
RH Huang, CL Yang - journal of the Operational Research Society, 2009 - Taylor & Francis
RH Huang, CL Yang
journal of the Operational Research Society, 2009•Taylor & FrancisThis study presents an algorithm for efficient scheduling in terms of total flow time and
maximum earliness. All the algorithms in the literature for solving this problem are based on
heuristic procedures, and cannot necessarily generate all efficient schedules. This study
shows that this problem can actually be solved in pseudo-polynomial time, and develops an
algorithm for so doing. The complexity of the algorithm is O (n 2p̄ log n). Its computational
performance in solving problems of various sizes is determined.
maximum earliness. All the algorithms in the literature for solving this problem are based on
heuristic procedures, and cannot necessarily generate all efficient schedules. This study
shows that this problem can actually be solved in pseudo-polynomial time, and develops an
algorithm for so doing. The complexity of the algorithm is O (n 2p̄ log n). Its computational
performance in solving problems of various sizes is determined.
Abstract
This study presents an algorithm for efficient scheduling in terms of total flow time and maximum earliness. All the algorithms in the literature for solving this problem are based on heuristic procedures, and cannot necessarily generate all efficient schedules. This study shows that this problem can actually be solved in pseudo-polynomial time, and develops an algorithm for so doing. The complexity of the algorithm is O (n2p̄ log n). Its computational performance in solving problems of various sizes is determined.
Taylor & Francis OnlineShowing the best result for this search. See all results