The cyclic permutation flow shop is one flow shop that repetitively produces product mix under permutation schedules. We propose that the cyclic permutation flow shop given the general job sequence can be modeled as a time event graph, based on which the mixed-integer programming method is applied to find the optimal schedule with maximum throughput. Two cases of cyclic permutation flow shops w...

We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the problems under consideration can be approximated in polynomial time within arbitrarily good precision. Most of our results are derived by APX-hardness proofs. We show that, whereas scheduling on unrelated machines with unit...

This article examines the multi-objective scheduling of a reentrant hybrid flow shop. This type of shop is composed of several stages made of several identical parallel machines. When a task has to be processed on a stage, it is assigned to the machine with the smallest workload. This problem shows a reentrant structure: each task must be processed several times at each stage. In this paper, th...

Minimum makespan scheduling of Flow Shops with Multiple Processors (FSMPs), also known as the Hybrid Flow Shop (HFS), is classified as NP complete. Thus, the FSMP largely depends on strong heuristics to develop solutions to makespan scheduling instances. An FSMP consists of m stages wherein each stage has one or more processors through which n jobs are scheduled. This paper presents a heuristic...

The optimization of energy consumption in the cloud computing environment is the question how to use various energy conservation strategies to efficiently allocate resources. The need of different resources in cloud environment is unpredictable. It is observed that load management in cloud is utmost needed in order to provide QOS. The jobs at over-loaded physical machine are shifted to under-lo...

assembly line production is one of the widely used basic principles in production system. the problem of assembly line balancing deals with the distribution of activities among the workstations so that there will be maximum utilization of human resources and facilities without disturbing the work sequence. research works reported in the literature mainly deals with minimization of idle time i.e...

Abstract: In machine job shops with automated guided vehicles (AGVs) as mean of transportation of job parts, it’s usually hard to determine the optimal fleet size of AGVs for achieving a desired performance. In this paper a heuristic AGV dispatching algorithm is constructed based on the concept of ideal pipeline and Petri Net theory to balance the job part scheduling and AGV dispatching that mi...

Persons with disabilities have severe problems participating in the job market and their unemployment rate is usually much higher than the average of the population. This motivates the research of new modes of production which allow the inclusion of these persons at a low overhead. In this paper we study the inclusion of persons with disabilities into flow shops with the objective of minimizing...