THE CYCLIC LOT SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SETUPS
成果类型：
Article
署名作者：
DOBSON, G
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.40.4.736
发表日期：
1992
页码：
736-749
关键词：
摘要：
In this paper, we formulate the cyclic lot scheduling problem on a single facility with sequence-dependent setup costs and times and provide a heuristic solution procedure. A Lagrangian relaxation of the formulation leads to a partial separation of the embedded lot sizing and traveling salesman problems. The relaxation results in a new combinatorial problem related to the minimum spanning tree problem. The information about frequency of production, gained from the solution to this relaxation, is used to find heuristic solutions for the entire problem. Computational work on randomly generated problems shows that the problem becomes more difficult as the diversity in the sequence-dependent parameters increases.