In this paper, we consider a scheduling problem with position-based deteriorating jobs and past-sequence-dependent delivery times on a single machine or parallel machines. Each job's delivery time is dependent on its waiting time for processing. Because of the deteriorating effect, each machine will undergo multiple rate-modifying activities throughout the planning horizon to restore its processing rate. For the single-machine * Corresponding author 1450018-1 Asia Pac. J. Oper. Res. 2014.31. Downloaded from www.worldscientific.com by MONASH UNIVERSITY on 02/05/15. For personal use only. K. Chen et al.case, the objectives are to minimize the makespan and the total completion time. For the parallel-machine case, the objectives are to minimize the total completion time and the total machine load. We show that all these problems are solvable in polynomial time.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.