Abstract: This paper discusses a class of linear programming problems with interval coefficients in both the objective functions and constraints. The noninferior solutions to such problems are defined ...

Two objective functions, i.e., the number of late jobs and total setup time, are minimized. A mixed integer linear program is established to describe the problem. To obtain its Pareto solutions, we ...