返回
A DUE DATE ASSIGNMENT ALGORITHM FOR MULTIPRODUCT MANUFACTURING FACILITIES
DOI:10.1016/0377-2217(93)90332-H.png)
摘要
En 中文
The order acceptance process is an important interface between a manufacturer and its customers. This paper considers a complex manufacturing facility, capable of simultaneously producing a large variety of products, e.g., printed wiring boards for telecommunications and electronic systems. A requested due date is submitted with each customer order. A batch of orders is accumulated by the manufacturer for a certain period, e.g., one week or one day. For each order, production control must either confirm the requested due date or propose an alternate due date. (Some high-priority orders may be confirmed shortly upon receipt.) We develop a heuristic, the Due Date Assignment Algorithm, to solve the order acceptance problem. Its objective is to minimize the sum of weighted (positive) deviations of the assigned due dates from the requested dates. The heuristic first generates a menu of candidate schedules for each order. It then applies a Lagrangean relaxation scheme to an integer programming formulation of the problem. Finally, an interchange procedure is applied, if necessary, to obtain primal feasibility. Computational results revealed significant improvements over the often-used policy of assigning a due date to each single order upon its arrival.
Keyword:
PRODUCTION PLANNING
PRODUCTION SCHEDULING
LAGRANGEAN RELAXATION
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
The nose has it: Opportunities and challenges for intranasal drug administration for neurologic conditions including seizure clusters鼻子有它: 包括癫痫发作群在内的神经系统疾病的鼻内给药的机遇和挑战
The Effect of Dietary Pattern on Metabolic Syndrome in a Suburban Population in Shanghai, China
Nutrients
IF0

