并行机生产与具有等待时间限制的成批运输协调调度问题-控制与决策.PDFVIP

绗?6 鍗 绗? 鏈 鎺 鍒 涓 鍐 绛 2011 骞 6 鏈 Vol. 26 No. 6 Control and Decision Jun. 2011 鏂囩珷缂栧彿: 1001-0920 (2011) 06-0921-04 骞惰鏈虹敓浜т笌鍏锋湁绛夊緟鏃堕棿闄愬埗鐨勬垚鎵硅繍杈撳崗璋冭皟搴﹂棶棰 1,2 2 瀹 鍗 , 鍞愮珛鏂 (1. 娌堥槼鐞嗗伐澶у鐞嗗闄紝娌堥槼110159锛?. 涓滃寳澶у淇℃伅绉戝涓庡伐绋嬪闄紝娌堥槼110819) 鎽 瑕? 鐮旂┒浜嗚繍杈撻樁娈靛叿鏈夌瓑寰呮椂闂撮檺鍒剁殑鎴愭壒杩愯緭涓庡苟琛屾満鐢熶骇鍗忚皟璋冨害闂, 鐩爣涓烘渶灏忓寲鍒堕€犳湡涓庤繍杈撹垂 鐢ㄤ箣鍜? 閫氳繃澶嶆潅鎬у垎鏋? 璇佹槑鍏舵槸寮篘P 闅鹃棶棰? 鎻愬嚭鍚彂寮忕畻娉曞苟璇佹槑鍏舵渶鍧忔儏鍐垫€ц兘姣斾负4 鈭 1/饊仛. 褰撲竴涓繍杈 鎵瑰繀椤诲湪鍚屼竴鍙版満鍣ㄥ姞宸ユ椂, 璇佹槑鍏朵篃鏄己NP 闅鹃棶棰? 灏嗗姞宸ユ椂闂翠笌绛夊緟鏃堕棿闄愬畾鍊艰繘琛屾瘮杈? 鍒嗗埆鎻愬嚭涓や釜鍚彂 寮忕畻娉? 骞惰瘉鏄庡叾鏈€鍧忔儏鍐垫€ц兘姣斿垎鍒负2 鈭 1/饊仛 鍜? 鈭 1/饊仛. 鍏抽敭璇岤 骞惰鏈猴紱鎴愭壒杩愯緭锛涘鏉傛€э紱鏈€鍧忔儏鍐 涓浘鍒嗙被鍙耳 TP301 鏂囩尞鏍囪瘑鐮? A Scheduling production on parallel machines and batch delivery with limited waiting time constraint GONG Hua1,2 , TANG Li-xin2 (1. College of Science锛孲henyang Ligong University锛孲henyang 110159锛孋hina 锛?. College of Information Science and Engineering锛 Northeastern University 锛 Shenyang 110817锛 China 锛 Correspondent 锛 TANG Li-xin 锛 E-mail: qhjytlx@mail.neu.edu.cn) Abstract: This paper studies a coordinated scheduling problem of production on parallel machines and batch delivery where the 铿乶ished jobs must be deliveried in a limited time. The objective is to minimize the sum of the makespan and the total delivery cost. Through the complexity analysis, it is proved that the problem is strongly NP-hard, and a heuristic algorithm is provided with the worst-case ratio 4 鈭 1/饊仛. A special case is also considered, where the jobs in a batch delivery must be processed on the same machine. For this case, it is proved that the problem is strongly NP-hard, and two heuristic algorithms are provided with the worst-case ratio 2 鈭 1/饊仛 and 4 鈭