Journal
JOURNAL OF SCHEDULING
Volume 19, Issue 6, Pages 737-757Publisher
SPRINGER
DOI: 10.1007/s10951-016-0472-2
Keywords
Time-dependent scheduling; Nonmonotonic piecewise-linear processing time; Convex processing time; Single-machine scheduling; Assembly-line worker path minimization
Ask authors/readers for more resources
In time-dependent scheduling, various processing time functions are studied, yet absolute value functions have surprisingly been omitted from the discussion. Such a processing time function increases linearly with a job's discrepancy from its ideal midtime. The objective is to find a schedule that minimizes the makespan, introducing the discrepancy time minimization problem. This single-machine scheduling problem with time-dependent processing times is motivated by optimization of walking times on a car assembly line. Its decision version is NP hard, as we show by reduction of the even-odd partition problem. For the variant with known start time, we develop several heuristics. Further insights form lower bounds and dominance rules for a branch-and-bound search. Numerical experiments show the performance of our algorithms on problem instances of up to 60 jobs. For the variant with common ideal midtime and flexible start time, we present a polynomial-time algorithm.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available