Open Access Open Access  Restricted Access Subscription or Fee Access

The Time Limit Assignment Problems

Guozhong Bai, Xiao-Xiong Gan


This paper establishes a new assignment problem called the time limit assignment problem (TLAP) which pursues the best overall efficiency only if all tasks have been completed in time or very close to the deadline. The time limit assignment problem contains one discrete goal constraint, and therefore it is a special goal programming problem. This paper provides a mathematical model for such a time limit assignment problem and introduces a method to find its optimal solutions and the deviation of the optimal solution to the warning time. We also provide an example that illustrates how to solve the time limit assignment problem.


assignment problem, goal programming, time limit, mathematical model, optimal solution.

Full Text:



  • There are currently no refbacks.

Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.