Author:
Wang Xuyin, ,Liu Weiguo,Li Lu,Zhao Peizhen,Zhang Ruifeng,
Abstract
<abstract><p>In this paper, we investigate the single-machine scheduling problem that considers due date assignment and past-sequence-dependent setup times simultaneously. Under common (slack and different) due date assignment, the objective is to find jointly the optimal sequence and optimal due dates to minimize the weighted sum of lateness, number of early and delayed jobs, and due date cost, where the weight only depends on it's position in a sequence (i.e., a position-dependent weight). Optimal properties of the problem are given and then the polynomial time algorithm is proposed to obtain the optimal solution.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Subject
Applied Mathematics,Computational Mathematics,General Agricultural and Biological Sciences,Modeling and Simulation,General Medicine
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献