We present a method for setting release times for jobs with due dates in a stochastic production flow line for which the sequence of jobs has been determined. Unlike other approaches to this problem, ours considers a transient situation. Thus, the flow line will typically contain work in process (WIP), that is, jobs that have been previously released to the system. Our goal is to develop a job ...

One of the cost-intensive issues in managing warehouses is the order picking problem which deals with the retrieval of items from their storage locations in order to meet customer requests. Many solution approaches have been proposed in order to minimize traveling distance in the process of order picking. However, in practice, customer orders have to be completed by certain due dates in order t...

In this paper, we study a resource-constrained project scheduling problem in which a set of project activities have due dates. If the finish time of each one of these activities is not equal to its due date, an earliness or a tardiness cost exists for each tardy or early period. The objective is to minimize the sum of discounted weighted earliness-tardiness penalty costs of these activities. Sc...

Many defects in manufacturing system are caused by human resources that show the significance of the human resources in manufacturing systems. Most manufacturers attempt to investigate the human resources in order to improve the work conditions and reduce the human error by providing a proper work-rest schedule. On the other hand, manufacturer deal with machine scheduling based on demand and wo...

This paper surveys the literature related to solving traditional unrelated parallel-machine scheduling problems. It compiles algorithms for the makespan, total weighted sum of completion times, maximum tardiness, total tardiness, total earliness and tardiness, and multiple criteria performance measures. The review of the existing algorithms is restricted to the deterministic problems without se...

We propose a new method of sequential and parallel speeding up of the process of solving a single machine scheduling problem with total tardiness cost function. This improvement is done on two levels: generating a neighborhood inside path relinking method (basing on new approach—blocks in solutions) and parallelization of generating paths. The obtained results are compared to the benchmark ones...

Dispatching rules are widely used to dynamically schedule the operations in a shop. Their efficiency depends on the performance criteria of interest. One of the most important objectives to deal with in a manufacturing system is the tardiness which can be measured through several performance measures. This paper proposes an effective procedure to estimate the first two central moments (i.e., th...

In this paper, we consider the slack due-window assignment model and study a single machine scheduling problem of linear time-dependent deteriorating jobs and a deteriorating maintenance activity. The cost for each job consists of four components: earliness, tardiness, window location and window size. The objective is to schedule the jobs and to assign the maintenance activity and due-windows s...