Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
نویسندگان
چکیده
منابع مشابه
Minimizing the Sum of Weighted Completion Times with Unrestricted Weights
Given a set of tasks with associated processing times, deadlines and weights unrestricted in sign, we consider the problem of determining a task schedule on one machine by minimizing the sum of weighted completion times. The problem is NP-hard in the strong sense. We present a lower bound based on task splitting, an approximation algorithm, and two exact approaches, one based on branch-and-boun...
متن کاملScheduling Jobs with Equal Processing Times
Whereas the overwhelming majority of scheduling problems appears to be NP-hard, models with equal processing time jobs form a remarkable case which is still open for most problems but it intuitively looks polynomially solvable. The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring an identical execution time p. There are associated a release time rj...
متن کاملScheduling jobs with position-dependent processing times
Bachman and Janiak provided a sketch of the proof that the problem 1|ri,pi(v)1⁄4 ai/v|Cmax is NP-hard in the strong sense. However, they did not show how to avoid using harmonic numbers whose encoding is not pseudo-polynomial, which makes the proof incomplete. In this corrigendum, we provide a new complete proof. Journal of the Operational Research Society (2012) 63, 1018–1020. doi:10.1057/jors...
متن کاملScheduling jobs with position and sum-of-processing-time based processing times
The paper is devoted to some single-machine scheduling problems with variable job processing times. The objectives are to minimize the makespan (i.e., the maximum completion time of all jobs), and to minimize the total completion time. For some special cases, we show that these problems can be solved in polynomial time. For some another special cases of the makespan and the total completion tim...
متن کاملMinimizing sum of completion times on a single machine with sequence-dependent family setup times
This paper presents a branch-and-bound (B&B) algorithm for minimizing the sum of completion times in a singlemachine scheduling setting with sequence-dependent family setup times. The main feature of the B&B algorithm is a new lower bounding scheme that is based on a network formulation of the problem. With extensive computational tests, we demonstrate that the B&B algorithm can solve problems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2008
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2006.03.067