考虑了机器带有安装时间和具有学习效应的单机供应链排序问题.在一条供应链系统中,有单个制造商和多个客户,不同的客户订购不同种类的工件,机器加工不同种类的工件前需要一个安装时间,且加工相同客户的工件时具有学习效应,即随着工件的加工后面工件的实际加工时间逐渐减小.完工的工件需要成批运输给相应的客户,每一批运输都有相应的时间和费用.目标是分别极小化加权最大配送时间、总配送时间、最大延迟时间与总运输费用的和.给出了相应的算法,并分析了算法的复杂性.
This paper considers the single machine supply chain scheduling with setup time and learn- ing effects. There are only one manufacturer and multiple customers in the supply chain system. Since the jobs belong to different job families, a setup time is incurred before the manufacturer processes a new fam- ily of jobs. There are learning effects when the jobs that are processed by the manufacturer for the same customer, which means the actual processing time of the job is decreased when there are some jobs of the same customer processed before this job. The completed jobs of the same customer need to be delivered in batches to their respective customers, and each shipment has a corresponding delivery time and transporta- tion cost. The goals of the paper are to minimize the maximum delivery time of jobs and total transporta- tion cost,the total weighted delivery time of jobs and total transportation cost of jobs, the weighted maxi- mum lateness of jobs and total transportation cost respectively. The appropriate dynamic programming al- gorithm is given,the algorithm is polynomial solvable.