This paper studies the single-machine scheduling problem with deteriorating jobs and learning considerations. The objective is to minimize the makespan. We first show that the schedule produced by the largest growth rate rule is unbounded for our model, although it is an optimal solution for the scheduling problem with deteriorating jobs and no learning. We then consider three special cases of ...

Traditional scheduling assumes that the processing time of a job is fixed. Yet there are numerous situations that the processing time increases (deteriorates) as the start time increases. In particular, lots of work has been devoted to jobs with simple linear deterioration. The processing time pj of job Jj is a simple linear function of its start time sj , precisely, pj = bjsj , where bj is the...

This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...

This paper considers the two-agent scheduling problems with deteriorating jobs and group technology on a single machine, where the objective is to minimize the total completion time of the first agent with the restriction that the maximum cost of the second agent cannot exceed a given upper bound. Two agents compete to perform their respective jobs on a common single machine, and each agent has...

We consider the problem of scheduling linearly deteriorating jobs on a single machine. Between the jobs there are defined arbitrary precedence constraints and the objective is to minimize the maximum cost. For this problem we propose an exact algorithm and a heuristic. We also report preliminary results of computational experiments conducted in order to evaluate the quality of schedules generat...

In this study, we consider the resource allocation scheduling with a deterioration effect and position-dependent workloads concurrently on single machine. The scheduler needs to find optimal sequence such that cost function is minimized. First, focus minimizing linear weighted sum of schedule consumption cost. Second problem minimize subject an upper bound Third Last Pareto-optimal solutions fo...