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...

We consider two single-machine group scheduling problems with deteriorating group setup and job processing times. That is, the job processing times and group setup times are linearly increasing or decreasing functions of their starting times. Jobs in each group have the same deteriorating rate. The objective of scheduling problems is to minimize the sum of completion times. We show that the sum...

Article history: Received 5 August 2013 Received in revised form 2 May 2014 Accepted 28 May 2014 Communicated by D.-Z. Du

We consider a single machine scheduling problem in which the processing time of a job is a simple linear increasing function of its starting time and the machine is subject to an availability constraint. We consider the non-resumable case. The objectives are to minimize the makespan and the total completion time. We show that both problems are NP-hard and present pseudo-polynomial time optimal ...

This paper explores the problems of unrelated parallel-machine scheduling with aging effects and deteriorating maintenance activities. The jobs are non-resumable. Each machine has at most one maintenance activity which is allowed throughout the planning horizon. Assume that once the maintenance activity is completed, the functions of machine and the properties of jobs e.g. the temperature (hard...

We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. The objective is to minimize the makespan. We first show that the problem can be solved optimally by 0–1 integer progra...

Several papers published during the last decade dealt with scheduling a maintenance activity and considered a new setting, where the maintenance duration is assumed to be deteriorating, i.e., it requires more time or effort if it is delayed. We study a deteriorating maintenance in the context of due-window assignment, where a time interval is determined such that jobs completed within this inte...