WOS: 000262979600005In this study, single machine scheduling problem with unequal release dates and a learning effect is considered. The objective function of the problem is minimization of the total weighted completion time. A non-linear mathematical programming model is developed for the problem which belongs to NP-hard class. Also the model is tested on an example. Results of computational tests show that the proposed model is effective in solving problems with up to 30 jobs. (C) 2008 Elsevier Inc. All rights reserved
Abstract. In this paper we study the problem of minimizing the weighted sum of completion times of j...
WOS: 000273012500023In traditional scheduling problems, most literature assumes that the processing ...
This paper considers a single machine scheduling problem to determine release and processing times w...
Abstract: This study considers the scheduling problem of minimizing the total completion time on a s...
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with...
International audienceIn this study, we consider the single machine scheduling problem with release ...
AbstractThis paper introduces a new time-dependent learning effect model into a single-machine sched...
A natural and basic problem in scheduling theory is to provide good average quality of service to a ...
19 pages, 4 figuresIn this paper, we focus on the solution of a hard single machine scheduling probl...
AbstractEach of n jobs is to be processed without interruption on a single machine which can handle ...
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with...
This paper is devoted to the following version of the single machine preemptive scheduling problem ...
We give a (2+ϵ)-approximation algorithm for minimizing total weighted completion time on a single ma...
AbstractLearning and job deterioration co-exist in many realistic scheduling situations. This paper ...
International audienceIn this paper, we consider an identical parallel machine scheduling problem wi...
Abstract. In this paper we study the problem of minimizing the weighted sum of completion times of j...
WOS: 000273012500023In traditional scheduling problems, most literature assumes that the processing ...
This paper considers a single machine scheduling problem to determine release and processing times w...
Abstract: This study considers the scheduling problem of minimizing the total completion time on a s...
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with...
International audienceIn this study, we consider the single machine scheduling problem with release ...
AbstractThis paper introduces a new time-dependent learning effect model into a single-machine sched...
A natural and basic problem in scheduling theory is to provide good average quality of service to a ...
19 pages, 4 figuresIn this paper, we focus on the solution of a hard single machine scheduling probl...
AbstractEach of n jobs is to be processed without interruption on a single machine which can handle ...
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with...
This paper is devoted to the following version of the single machine preemptive scheduling problem ...
We give a (2+ϵ)-approximation algorithm for minimizing total weighted completion time on a single ma...
AbstractLearning and job deterioration co-exist in many realistic scheduling situations. This paper ...
International audienceIn this paper, we consider an identical parallel machine scheduling problem wi...
Abstract. In this paper we study the problem of minimizing the weighted sum of completion times of j...
WOS: 000273012500023In traditional scheduling problems, most literature assumes that the processing ...
This paper considers a single machine scheduling problem to determine release and processing times w...