This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and mi...

In this paper, three criteria scheduling problem of n jobs on a single machine is considered. Each these to be processed without interruption and becomes available for processing at time zero. The minimize objectives simultaneously, which are the completion time, maximum tardiness, earliness. Here, we develop fuzzy multi-objective linear programming (FMOLP) model solving in environment by using...

In practical problems, in addition to the processing time of job, impact required for delivering service customers on cost is also considered, i.e., delivery time, where job a simple linear function its starting time. This paper considers past-sequence-dependent times (which can be referred as psddt) studied objectives three types due windows (common, slack and different windows). serves minimi...