本文考虑了多个客户订购不同种类的工件,工件生产完后需要运输到客户的单机供应链排序问题.由于工件属于不同的种类,在加工不同种类工件前要有一个准备时间.每个客户分布在不同位置,客户的每个工件都有一个交货期,工件是分批配送的,每一批配送需要花费一定的时间及费用.考虑了两个与交货期有关的目标函数,分别给出了它们的最优算法.%We consider the single machine scheduling problems in which 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.Each job has a due date and each shipment incurs a delivery cost and takes a fixed amount of time.We consider two due date related objectives and give optimal algorithms to solve the problems.
展开▼