作　　者： ; ; ;

机构地区： 暨南大学管理学院

出　　处： 《暨南大学学报（自然科学与医学版）》 2010年第3期277-279,285,共4页

摘　　要： 考虑了多个客户订购不同种类的工件,工件生产完后需要运输到客户的单机供应链排序问题.由于工件属于不同的种类,在加工不同种类工件前要有一个准备时间.加工完成的工件分批配送到相应的客户处,每一批配送需要花费一定的时间及费用.考虑了两个目标函数,并分别给出了它们的最优算法. The single machine scheduling problems with family setup are considered.The jobs belong to different families and they need to be delivered to multiple customers after processing.A setup time is incurred for a job if it is the first job to be processed on a machine or its processing on a machine follows a job that belongs to another family.Processed jobs are delivered in batches to their respective customers.The batch size is limited by the capacity of the delivery vehicles and each shipment incurs a delivery cost and takes a fixed amount of time.Two objectives are studied and optimal algorithms are proposed to solve the problems.

关 键 词： 排序 准备时间 分批配送 成组技术

领　　域： [理学] [理学]