Customer order scheduling to minimize the number of late jobs

Miao-Tsong Lin*, A. V. Kononov

*Corresponding author for this work

研究成果: Article同行評審

23 引文 斯高帕斯(Scopus)

摘要

In the order scheduling problem, every job (order) consists of several tasks (product items), each of which will be processed on a dedicated machine. The completion time of a job is defined as the time at which all its tasks are finished. Minimizing the number of late jobs was known to be strongly NP-hard. In this note, we show that no FPTAS exists for the two-machine, common due date case, unless P = NP. We design a heuristic algorithm and analyze its performance ratio for the unweighted case. An LP-based approximation algorithm is presented for the general multicover problem. The algorithm can be applied to the weighted version of the order scheduling problem with a common due date.

原文English
頁(從 - 到)944-948
頁數5
期刊European Journal of Operational Research
183
發行號2
DOIs
出版狀態Published - 1 十二月 2007

指紋 深入研究「Customer order scheduling to minimize the number of late jobs」主題。共同形成了獨特的指紋。

引用此