|
|||||
|
|
| 二台机器的流水作业中存在调整时间的LOT—STREAMING问题 | |
| 引用本文： | 谢琪 陈寒冰. 二台机器的流水作业中存在调整时间的LOT—STREAMING问题[J]. 应用数学与计算数学学报, 1996, 10(2): 1-11 |
| 作者姓名： | 谢琪 陈寒冰 |
| 作者单位： | 上海大学嘉定校区!上海201800 |
| 摘 要： | 对二台机器流作业中的Ｌｏｔ－Ｓｔｒｃａｍｉｎｇ问题（简称ＬＳ），以往的研究多为固定分批数寻找各批大小，或对二台机器引入相同的调整时间，寻找量优分批数及和批大小，本文对机器１，２每生产一个新的子批量分别引入一独立的调整时间Ｓ１，Ｓ２，研究同时决定最优分批数和最优分批大小，并给出相应的最优算法。 |
| 关 键 词： | 排序 调整时间 LS问题 算法 流水作业 |
Lot-Streaming in A Two Machines Flow Shop with Setup Times Separated |
|
| Xie Qi Chen Hanbing Sun Shijie. Lot-Streaming in A Two Machines Flow Shop with Setup Times Separated[J]. Communication on Applied Mathematics and Computation, 1996, 10(2): 1-11 | |
| Authors: | Xie Qi Chen Hanbing Sun Shijie |
| Abstract: | For the Lot-Streaming problem in a two machines flow shop, the majority of the research presented fixed the number of the sublets, or the two machines have the same setup times. In this paper, the distinct setup times for the two machines are introduced, both the number of the sublets and sublots sizes are needed to be decided, and the corresponding algorithms are constructed. |
| Keywords: | sequencing setup time lot-streaming algorithm. |
| 本文献已被 CNKI 维普 等数据库收录！ | |