Modern algebraic geometry, and particularly the technical underpinnings which frequently form the basis of an introductory course in schemes, is very much like a well-stocked machine shop with instructions in a foreign language. It would be easy to spend the entire year simply translating all the instructions for the different tools in the shop, but this would provide little indication of what ...

Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...

One of the earliest results in flow shop scheduling theory is an algorithm given by Johnson’s [1] for scheduling jobs on two or three machines to minimize the total elapsed time whenever the processing times of jobs are random. The present paper is an attempt to develop a heuristic algorithm for two stages specially structured flow shop scheduling in which the processing times of the jobs a...

The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by Allahverdi et al. (1999), who reviewed the literature since the mid-1960s. Since the appearance of that survey paper, there has been an increasing interest in scheduling problems with setup times (costs) with an average of more than 40 papers per year being added to the literature. Th...

OBJECTIVES To address the lack of up-to-date published data, the present study evaluates the PCR-based prevalence of Cryptosporidium species infection and molecular characteristics of isolates among household cats and pet shop kittens in Japan. METHODS A total of 357 and 329 fresh faecal samples were collected from household cats and pet shop kittens, respectively, with or without clinical si...

One of the main restrictions in scheduling problems are the machine (resource) restrictions: each machine can perform at most one job at a time. We explore machine dependencies is shop scheduling problems representing them as graphs. Our study shows that the structure of machine dependency graphs is important in the complexity analysis of shop scheduling problems. We call acyclic a shop schedul...

A model combining Discrete Event System (DES) and Multi-Agent System (MAS) is proposed to simulate a real-time job shop so that it can work as a test bed to systematically study the performance of control rules and algorithms in dynamic job shop scheduling. A definition of a generic job shop is given considering dynamic events, shop floor layout and the Material Handling System (MHS). It is fir...

In this paper we consider n-jobs, m-machines permutation flow shop scheduling problems. Flow shop scheduling is one of the most important combinational optimization problems. The permutation flow shop scheduling problems are NP-Hard (Non deterministic Polynomial time Hard). Hence many heuristics and metaheuristics were addressed in the literature to solve these problems. In this paper a hybrid ...