The single-machine lot scheduling problem with splittable jobs to minimize the number of tardy jobs has been showed to be weakly NP-hard in the literature.In this paper,we show that a generalized version of this probl...The single-machine lot scheduling problem with splittable jobs to minimize the number of tardy jobs has been showed to be weakly NP-hard in the literature.In this paper,we show that a generalized version of this problem in which jobs have deadlines is strongly NP-hard,and also present the results of some related scheduling problems.展开更多
In this paper we consider a single machine multi-product lot scheduling problem in which defective items are produced in any production run of each product. In each cycle after the normal production of each product th...In this paper we consider a single machine multi-product lot scheduling problem in which defective items are produced in any production run of each product. In each cycle after the normal production of each product the machine is setup for the rework of the defectives of the same product and then the rework process starts. We assume that the setup time for the normal production process as well as the rework process is non-zero. Further we consider the waiting time cost of defectives for rework. This paper has two objectives. The first objective is to obtain the economic batch quantity （EBQ） for a single product. The second objective is to extend the result of the first objective to the multi-product case. Adopting the common cycle scheduling policy we obtain optimal batch sizes for each product such that the total cost of the system per unit time is minimized.展开更多
基金Supported by National Natural Science Foundation of China(Grant Nos.12071442,11971443,12271491)。
文摘The single-machine lot scheduling problem with splittable jobs to minimize the number of tardy jobs has been showed to be weakly NP-hard in the literature.In this paper,we show that a generalized version of this problem in which jobs have deadlines is strongly NP-hard,and also present the results of some related scheduling problems.
文摘In this paper we consider a single machine multi-product lot scheduling problem in which defective items are produced in any production run of each product. In each cycle after the normal production of each product the machine is setup for the rework of the defectives of the same product and then the rework process starts. We assume that the setup time for the normal production process as well as the rework process is non-zero. Further we consider the waiting time cost of defectives for rework. This paper has two objectives. The first objective is to obtain the economic batch quantity （EBQ） for a single product. The second objective is to extend the result of the first objective to the multi-product case. Adopting the common cycle scheduling policy we obtain optimal batch sizes for each product such that the total cost of the system per unit time is minimized.
