Printing Scheduling with a Constrained Number of Colors
碩士 === 國立交通大學 === 資訊管理研究所 === 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 i...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/73axay |