In previous work we introduced a simple constraint model that combined generic AI strategies and techniques (weighted degree heuristic, geometric restarts, nogood learning from restarts) with naive propagation for job shop and open shop scheduling problems. Here, we extend our model to handle two variants of the job shop scheduling problem: job shop problems with setup times; and job shop probl...

After more than ten years of widespread use of e-commerce, there are still only a few models to specify the connection between consumer acceptance and the characteristics of an online shop. In particular, the available literature does not provide any constructs to evaluate the most basic functionality of an online shop: its search features. In this paper we describe a shopping experiment to val...

In this paper, we propose 260 scheduling problems whose size is greater than that of the rare examples published. Such sizes correspond to real dimensions of industrial problems. The types of problems that we propose are : the permutation flow shop, the job shop and the open shop scheduling problems. We restrict us to basic problems : the processing times are fixed, there are neither set-up tim...

We describe the application of simulation and statistical analysis to the problem of optimization of palletization in a production job shop. These analyses enabled management responsible for the production of this job shop to optimize the number of pallets, the size (carrying capacity) of the pallets, the associated workin-process levels, and policy regarding level of safetystock kept on hand a...

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.

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