A Parametric Programming Problem for Selecting the Optimal Scheme of Waiting Time of the Stuffs for Work

In this paper, we propose a discrete parametric programming problem in which the feasible region is a set of the waiting time schemes, and beginning and closing times of the stuffs for work are alternated strictly with an invariable ratio (parameter). The objective function is represented by min-max operator. We study change of feasible region and minimum of the objective function according to change of the parameter. Moreover we study relations of the parametric programming problem and a multi-objective problem.