Abstract
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 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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
