In this paper, we present a deterministic permutation flowshop scheduling problem with new objective function, the total core idle time. The interest of is related to reduce energy consumption system, taking into account that needed during processing times constant, and machines are switched off front back times. Therefore, dependent on time where in stand-by mode, i.e between jobs, named as Co...

This paper applies the new developed heuristic electromagnetism-like mechanism (EM) algorithm for the permutation flowshop scheduling problem. This algorithm simulates the electromagnetism theory by considering each solution as an electrical charge. Through the attraction-repulsion of the charges, solutions move to the optimality without being trapped into local optima. We make use of random ke...

This paper pertains to a two machine flowshop scheduling involving independent setup time, transportation time and job block criteria in fuzzy environment. Further, a single transporting agent which carries the jobs from one machine to another is also considered. The objective of the paper is to minimize the makespan, idle time of the machines whenever the processing time, setup time each are u...

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the setup ...

The introduction of NVidia’s powerful Tesla GPU hardware and Compute Unified Device Architecture (CUDA) platform enable many-core parallel programming. As a result, existing algorithms implemented on a GPU can run many times faster than on modern CPUs. Relatively little research has been done so far on GPU implementations of discrete optimisation algorithms. In this paper, two approaches to par...

This paper focuses on a two-machine re-entrant flowshop scheduling problem with the objective of minimizing makespan. In the re-entrant flowshop considered here, all jobs must be processed twice on each machine, that is, each job should be processed on machine 1, machine 2 and then machine 1 and machine 2. We develop dominance properties, lower bounds and heuristic algorithms for the problem, a...

There are numerous instances of flowshop in the production process of process industry. When such characteristics as continuous production resulted from high-temperature environment or deteriorate intermediate products are took into consideration, it should be ensured that the waiting time of any job between two consecutive machines is not greater than a given value, which results in the flowsh...