This paper presents a new mixed-integer goal programming (MIGP) model for a parallel machine scheduling problem with sequence-dependent setup times and release dates under the hypothesis of fuzzy processing time’s knowledge. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. At the end, the effectiveness of the pr...

The problem of determining a schedule of jobs with unit time lengths on a single machine that minimizes the total weighted earliness and tardiness penalties with respect to arbitrary rational due dates is formulated as an integer programming problem We show that if the penalties meet a certain criterion called the Dominance Condition then there exists an extremal optimal solution to the LP rela...

We consider preemptive machine scheduling problems on identical parallel machines. It is shown that every such problem with chain-like precedence constraints, release dates and a regular unit-concave objective function has the following integer preemption property : for any problem instance with integral input data there exists an optimal schedule where all interruptions (as well as starting an...

this paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. the objective is to minimize the weighted sum of makespan and maximum tardiness. three meta-heuristic methods based on genetic algorithm (ga), imperialist competitive algorithm (ica) and a hybrid approach of ga a...

In this researcha particle swarm optimization (PSO) algorithm is proposedfor no-wait flowshopsequence dependent setuptime scheduling problem with weighted earliness-tardiness penalties as the criterion ( | , | ∑ " ).The smallestposition value (SPV) rule is applied to convert the continuous value of position vector of particles in PSO to job permutations.A timing algorithm is generated to find t...

We consider a special class of resource-constrained single machine scheduling problems. In the classical context, resource types are classified into renewable and non-renewable; however, large variety real-world problems may not fit one these classes, e.g. labour regulations in project scheduling, budget allocation to different phases construction project, dose management medical imaging centre...