We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e., deteriorating effect). The problem is to determine the optimal due-windows, and the processing sequence simultaneously to minimize a cost funct...

We study the problem of unrelated parallel-machine scheduling with deteriorating maintenance activities. Each machine has at most one maintenance activity, which can be performed at any time throughout the planning horizon. The length of the maintenance activity increases linearly with its starting time. The objective is to minimize the total completion time or the total machine load. We show t...

We address the problem of determining schedules for static, single-machine scheduling problems where the objective is to minimize the sum of weighted tardiness and weighted earliness. We develop optimal and heuristic procedures for the special case of weights that are proportional to the processing times of the respective jobs. The optimal procedure uses dominance properties to reduce the numbe...

This paper considers a scheduling problem for minimizing the sum of the absolute deviations of completion times from the due dates of all jobs (earliness-tardiness) on a single batch processing machine. For this problem, each job has a corresponding processing time and size and all jobs have the common due date. The problem under study is NP-hard and hence a hybrid genetic algorithm based on a ...

In this paper a multicriteria scheduling problem with sequence-dependent setup times on a single machine is considered. The objective function of the problem is minimization of the weighted sum of total completion time, maximum tardiness and maximum earliness. An integer programming model is developed for the problem which belongs to NP-hard class. Only small size problems with up to 12 jobs ca...

Under just-in-time production, this paper studies a single machine common due-window (denoted by CONW) assignment scheduling problem with position-dependent weights and resource allocations. A job’s actual processing time can be determined the assigned to job. allocation model is divided into linear convex models, our goal find an optimal location, job sequence allocation. We prove that weighte...

Article history: Received 19 January 2009 Received in revised form 17 April 2009 Accepted 30 April 2009 Available online 7 May 2009

In this paper, we study the single machine total completion scheduling problem subject to a period of maintenance. The problem is known to be NP-hard. We propose a pseudo-polynomial dynamic programming algorithm for the problem with time complexity O(nR), where n refers to the number of jobs and R to the date of the beginning of the maintenance. The efficiency of the algorithm is improved using...

extensive research has been devoted to resource constrained project scheduling problem. however, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. in this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...