关键词: job shop模型, 批量, 流水线, 优先级, 贪心算法

Abstract: An extended job-shop model is proposed, as well as the work center and key nodes. In this new model, assembly line and batch scheduling are introduced. Based on this, this paper proposes a heuristic batch flow line scheduling algorithm in an extended job shop model, calculating the start time of remaining products by backtracking when selecting key nodes and using the greedy algorithm to sort the highest priority products. The priority rule is composed of three proxies variable including product value, time urgency and work remaining. The minimum processing batch size is set when processing. That makes parallel processing of multiple sets of equipment possible in one processing and the flow line between two adjacent processing, so as to reduce processing time and improve productivity. The simulation shows that this strategy can achieve better results.

Key words: job shop, batch, flow line, priority, heuristic algorithm