We present a new mathematical model for a permutation flowshop scheduling problem with sequence-dependent setup times considering minimization of two objectives, namely makespan and weighted mean total earliness/tardiness. Only small-sized problems with up to 20 jobs can be solved by the proposed integer programming approach. Thus, an effective multi-objective immune system (MOIS) is ...

this paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. the fuzzy set theory is applied to describe this situation. a novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. due to the computational complexities, the prop...

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 this paper, a multi-product single machine scheduling problem with the possibility of producing defected jobs, is considered. we concern rework in the scheduling environment and propose a mixed-integer programming (mip) model for the problem.  based on the philosophy of just-in-time production, minimization of the sum of earliness and tardiness costs is taken into account as the objective fu...

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...