Author(s)
Patrick R. McMullen
ABSTRACT
This research presents a problem relevant to production scheduling for mixed models – production schedules that contain several unique items, but each unique item may have multiple units that require processing. The presented research details a variant of this problem where, over multiple processes, resequencing is permitted to a small degree so as to exploit efficiencies with the intent of optimizing the objectives of required set-ups and parts usage rate via an efficient frontier. The problem is combinatorial in nature. Enumeration is used on a variety of test problems from the literature, and a search heuristic is used to compare optimal solutions with heuristic based solutions. Experimentation shows that the heuristic solutions approach optimality, but with opportunities for improvement.
http://www.scirp.org/journal/PaperInformation.aspx?PaperID=8914
No comments:
Post a Comment