|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 72 of 195 found articles
| Title: |
COMMON DUE-DATE ASSIGNMENT AND SCHEDULING FOR A SINGLE PROCESSOR TO MINIMIZE THE NUMBER OF TARDY JOBS |
| Author: |
Cheng, T. C. E. |
| Appeared in: |
Engineering optimization |
| Paging: | Volume 16 (1990) nr. 2 pages 129-136 |
| Year: |
1990 |
| Contents: |
This paper considers the problem of assigning a common due-date to a set of simultaneously available jobs and sequencing them on a single production facility. The objective is to determine the optimal common due-date value and job sequence that jointly minimize a cost function based on the assigned due-date and the number of tardy jobs. It is shown that the optimal due-date coincides with one of the job completion times and ordering jobs in non-decreasing processing times yields an optimal sequence which in general is not unique. An efficient (polynomial-bound) algorithm to find the optimal solution is presented and an illustrative example is provided. |
| Publisher: |
Taylor & Francis |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 72 of 195 found articles
| << previous | next >> |