Scheduling of Value-Recoverable Jobs for Maximizing Total Job Value over a Planning Horizon

Abstract

This thesis considers a value-recovery scheduling problem of multiple jobs over a given time horizon where each job decreases in its value with time, but it is value-recoverable such that the job can be recovered to its initial value-level by repeating its own recoverable process. The objective of the problem is to maximize total job value over a time horizon, for which a branch-and-bound algorithm is derived. A numerical experiment shows that the proposed heuristic provides effective solutions. This study results may immediately be applied to a variety of different scheduling issues including customer service ordering, customer satisfaction management, products/facility repairing, products display scheduling.