Economic Lot Scheduling for Multiple Products on Parallel Identical Processors
研究在确定性条件下，多产品在并行同构处理器上的批量调度问题，目标是单位时间平均生产和库存成本最小化，且不允许缺货和产品间干扰。提出了基于公共周期法的启发式算法，并给出了上下界以衡量算法效果。
This paper deals with an identical multiprocessor, multiproduct, lot-size scheduling problem under deterministic conditions. The problem is an extension of the single-processor ELSP problem. The objective is to minimize the average production and inventory costs per unit time subject to constraints of no shortages and no interference among the products. A mathematical formulation for the problem is given. A heuristic procedure, which extends the Common Cycle approach for a single processor, is suggested and computational results are reported. Upper and Lower bounds are developed and used to measure the effectiveness of the procedure.