This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the makespan for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly ge...

this study considers scheduling in hybrid flow shop environment with unrelated parallel machines for minimizing mean of job's tardiness and mean of job's completion times. this problem does not study in the literature, so far. flexible flow shop environment is applicable in various industries such as wire and spring manufacturing, electronic industries and production lines. after mode...

This paper solved the unrelated parallel machine scheduling with additional resources (UPMR) problem. The processing time and number of required for each job rely on that does processing. Each j needed units (rjm) during its a m. These are limited, this made UPMR difficult problem to solve. In study, maximum completion jobs makespan must be minimized. Here, we proposed genetic algorithm solve b...

This paper considers a scheduling problem of a set of independent jobs on unrelated parallel machines (UPMs) that minimizesthe maximum completion time (i.e., makespan or ), maximum earliness ( ), and maximum tardiness ( ) simultaneously. Jobs have non-identical due dates, sequence-dependent setup times and machine-dependentprocessing times. A multi-objective mixed-integer linear programmi...

This work deals with the parallel machines scheduling problem which consists in the assignment of n jobs on m parallel machines. The most general variant of this problem is when the processing time depends on the machine to which each job is assigned to. This case is known as the unrelated parallel machines problem. Similarly to most of the literature, this paper deals with the minimization of ...

We consider unrelated machine scheduling problems with the objective to minimize the schedule makespan. In addition to its machinedependence, the processing time of any job is also dependent on the usage of a scarce renewable resource. An amount of k units of that resource, e.g. workers, can be distributed over the jobs in process, and the more of that resource is allocated to a job, the smalle...