《2016 Single machine rescheduling with new jobs arrivals and processing time compression》.pdf

379 compression costs.The remainder of this paper is organized minimizing deviation from the original schedule. Two sets as follows. Section 2 next discusses related past work of local search heuristics were developed; the first set used on rescheduling problems and its relation to our work. pairwise swapping methods, using a weighted combination Sections 3 and 4 consider the rescheduling problem under of the two objectives to create a single objective. The different efficiency performance measures. These sections second is a local search heuristic based on a genetic present results and solution methods when the efficiency algorithm approach, considering a two dimensional space measure component of the objective function is the mini- of makespan and deviation; the quality of any given mum total completion time (Section 3) and the minimum solution point in the space can be measured based on its weighted tardiness cost (Section 4) respectively. Section 5 Euclidian distance to the origin. then summarizes and provides potential directions for Leon, Wu et al. [4] consider robustness measures and future research. robust scheduling methods for job-shop rescheduling with fallible machines. Robustness is expressed as a linear combination of the actual makespan after a disruption and 2 Literature review the deviation of the new makespan from the previous value. A time window called slack i