| Summary: | 碩士 === 國立交通大學 === 資訊管理研究所 === 105 === This paper studies printing scheduling with a constrained number of colors, which focuses on solving the knapsack packing problem with overlaps among items. Each printing order demands a subset of colors to start its processing. The research question addressed in this paper is to find a solution, a set containing the largest number of printing orders subject to the constraint that the total number of distinct colors involved does not exceed a specified limit.
We use an integer programming formulation to describe the problem and to find optimal solutions. Meanwhile, we develop a simulated annealing algorithm to obtain approximate solutions. Through a computational study, we compare the efficiency and quality of these two algorithms.
In the optimal solution experiment, we compare the impacts of each parameter in this problem. Also, in the approximate solution experiment, we design parameters of simulated annealing algorithm in this problem.
|
|---|
