The paper considers a three-machine shop scheduling problem to minimize the makespan, in which the route of a job should be feasible with respect to a machine precedence digraph with three nodes and one arc. For this NP-hard problem that is related to the classical flow shop and open shop models, we present a simple 1.5approximation algorithm and an improved 1.4-approximation algorithm.

Abstract Tri-flo cyclone, as a dense-medium separation device, is one of the most typical environmentally friendly industrial techniques in coal washery plants. Surprisingly, no detailed investigation has been conducted to explore effectiveness tri-flo cyclone operating parameters on their representative metallurgical responses (yield and recovery). To fill this gap, work for first time process...

BACKGROUND AND METHODOLOGY Little evidence is available on the extent to which one-stop shops address users' sexual health needs and the extent to which they identify additional needs users may not have identified. As part of the One-Stop Shop Evaluation, a questionnaire was designed to compare the reasons for users' visits and the reported outcomes of visits at a one-stop shop with the experie...

job shop scheduling problem has significant importance in many researchingfields such as production management and programming and also combinedoptimizing. job shop scheduling problem includes two sub-problems: machineassignment and sequence operation performing. in this paper combination ofparticle swarm optimization algorithm (pso) and gravitational search algorithm(gsa) have been presented f...

In the multi-operation scheduling that arises in industrial engineering, each job contains multiple tasks (operations) that require execution in different shops. It is assumed that in each shop there is only one machine to perform the required operations. In this paper, a parallel model of multi-operation scheduling is proposed, in which multiple machines are available in each shop to perform t...

In this paper, we propose two efficient scheduling algorithms for the total exchange, which is a basic communication pattern used on the GRID environment. Both algorithms are used with the open shop algorithm. The first algorithm is a static scheduling algorithm which partitions messages before the open shop algorithm, and the second algorithm is a dynamic algorithm used in the execution of the...

Rapid development of the Internet of Things not only provides large amounts of data to the job-shop scheduling, but also proposes a great challenge for dynamic job shop scheduling. A dynamic job shop scheduling approach is proposed based on the data-driven genetic algorithm. Application examples suggest that this approach is correct, feasible and available. This approach can provide the technic...

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

Developing approaches to integrating manufacturing applications is important for increasing manufacturing productivity. A reactive scheduling system architecture has been developed that defines how to integrate scheduling technology with manufacturing shop floor applications. Prototype implementations based on this architecture have been built using a simulation of a shop floor instead of a rea...