Article History: Received 05 January 2017 Accepted 23 February 2017 Available 15 July 2017 This study focuses on identical parallel machine scheduling of jobs with deteriorating processing times and rate-modifying activities. We consider nonlinearly increasing processing times of jobs based on their position assignment. Rate modifying activities (RMAs) are also considered to recover the increas...

In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machines. Each job’s processing time is a nondecreasing function of its start time. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of the due-date, earliness and tardiness penalties. We show that this problem is NP-hard, and we present a heuris...

This study focuses on solving a special kind of job shop scheduling problem (JSP), where the job value is exponentially deteriorating over time. The current study attempted to find out whether the expected benefits of Lot Streaming (LS) can be found in solving the JSP with the objective of maximizing the total value of the jobs. LS is a process of splitting jobs into smaller sub-jobs such that ...

Although scheduling with deteriorating jobs and learning effect has been widely investigated, scheduling research has seldom considered the two phenomena simultaneously. However, job deterioration and learning co-exist in many realistic scheduling situations. In this paper we introduce a new scheduling model in which both job deterioration and learning exist simultaneously. The actual processin...

The paper addresses the problem of maximizing the percentage of on-time jobs in a parallel machine environment with sequence dependent deterioration. The deterioration of each machine (and therefore of the job processing times) is a function of the sequence of jobs that have been processed by the machine. Two machine loading strategies are combined with a set of list scheduling algorithms to so...