公共交货期窗口待定的单机成组分批排序

公共交货期窗口待定的单机成组分批排序

赵洪銮¹，王骁力²，亓兴勤¹

1山东大学数学与系统科学学院,山东济南250100; 2南阳师范学院数学系, 河南南阳473061

收稿日期:2005-01-11 修回日期:1900-01-01 出版日期:2006-10-24 发布日期:2006-10-24
通讯作者: 赵洪銮

Single processor scheduling with batching and with penalty of common due window location

ZHAO Hong-luan¹，WANG Xiao-li²，QI Xing-qin¹

1. School of Math. and System Sci., Shandong Univ., Jinan 250100, Shandong, China;2. Depart. of Math., Nanyang Normal Univ., Nanyang 473061, Henan, China

Received:2005-01-11 Revised:1900-01-01 Online:2006-10-24 Published:2006-10-24
Contact: ZHAO Hong-luan

摘要/Abstract

摘要： 研究有组安装任务的单机窗时排序问题,所有工件的提前/延误惩罚费用相同;公共交货期窗口大小给定但位置待定,由线性定位费用衡量;最优排序是使所有这些费用的和最小.给出了最优排序的一些性质,提出一个多项式时间算法.

关键词: 分批排序, 交货期窗口, 最优排序算法 , 窗时排序, 组安装任务

Abstract: Single processor scheduling with a common due window and family setups is studied. All jobs have common earliness cost and common tardiness penalty, but the window location with linear cost is a decision variable. The objective is to minimize the sum of all the costs. Following some properties of the optimal scheduling, a polynomial algorithm is proposed.

Key words: optimal scheduling algorithm , windowtime scheduling, family setup, due window, batch scheduling

中图分类号:

TP301

赵洪銮,王骁力,亓兴勤 . 公共交货期窗口待定的单机成组分批排序[J]. J4, 2006, 41(1): 74-77 .

ZHAO Hong-luan,WANG Xiao-li,QI Xing-qin . Single processor scheduling with batching and with penalty of common due window location[J]. J4, 2006, 41(1): 74-77 .

参考文献

多维度评价

Viewed

Full text

Abstract

Cited

Shared

Discussed

[1]	韩国勇,赵洪銮,刘浩，刘振栋,张志军. 交货期窗口待定的有界同时加工排序问题的最优算法[J]. J4, 2012, 47(3): 77-80.
[2]	赵洪銮,张海燕, . 交货期窗口大小给定和待定情况下的单机排序问题[J]. J4, 2007, 42(8): 55-57 .