解决区域任务时间安排或双包装优化
原文：Solving task scheduling or bin-packing optimizations in R

我有一个选择问题。 它含有20个部分的产品(生产 does的顺序)。 我用3台类似的机器生产所有20个部件。

尽量减少颜色:纳普法算法的变化?
原文：Minimizing colors: a variation of the knapsack algorithm?

Working on a project I ve met this problem, which I will reword here in terms outside of the real domain of the problem (I suppose I could talk about calibers of fireworks and shapes, but it would ...