- search hit 1 of 1
Range of lower bounds
- Each of n jobs is to be processed without interruption on a single machine. Each job becomes available for processing at time zero. The objective is to find a processing order of the jobs which minimizes the sum of weighted completion times added with maximum weighted tardiness. In this paper we give a general case of the theorem that given in [6]. This theorem shows a relation between the number of efficient solutions, lower bound LB and optimal solution. It restricts the range of the lower bound, which is the main factor to find the optimal solution. Also, the theorem opens algebraic operations and concepts to find new lower bounds.
| Author details: | Ayad M. Ramadan |
|---|---|
| DOI: | https://doi.org/10.1016/j.amc.2011.03.066 |
| ISSN: | 0096-3003 |
| Title of parent work (English): | Applied mathematics and computation |
| Publisher: | Elsevier |
| Place of publishing: | New York |
| Publication type: | Article |
| Language: | English |
| Year of first publication: | 2011 |
| Publication year: | 2011 |
| Release date: | 2017/03/26 |
| Tag: | Efficient solutions; Lower bound; Multi objective function |
| Volume: | 218 |
| Issue: | 3 |
| Number of pages: | 4 |
| First page: | 1008 |
| Last Page: | 1011 |
| Organizational units: | Mathematisch-Naturwissenschaftliche Fakultät / Institut für Mathematik |
| Peer review: | Referiert |
