Many problems in industry are a form of open-shop scheduling problem (OSSP). We describe a hybrid approach to this problem which combines a Genetic Algorithm (GA) with simple heuristic schedule building rules. Excellent performance is found on some benchmark OSS problems, including improvements on previous best-known results. We describe how our approach can be simply amended to deal with the m...

Abstract: We develop a constant-inventory tactical planning model for a generic manufacturing system, such as a job shop. The model is based on a discrete-time, continuous flow model developed by the first author. In the model, we assume that we can regulate the release of work to the shop to maintain the constant-inventory constraint. We characterize the conditions for which the shop productio...

In the paper we discuss the influence of the route flexibility degree, the open rate of operations and the production type coefficient on makespan. The flexible job-open shop scheduling problem FJOSP (an extension of the classical job shop scheduling) is analyzed. For the analysis of the production process we used a hybrid heuristic of the GRASP (greedy randomized adaptive search procedure) wit...

This paper studies the problem of scheduling Job shops in robotic cells with no intermediate buffers, called No Wait Blocking Transport Job Shop Scheduling Problem (NWBT JSSP). This problem is an extension of the classical job shop problem. No Wait Blocking Transport job shop problems arise in many realistic production environments. To tackle this problem, we developed a Mixed Integer Linear Pr...

This study measured lead concentrations in both the outdoor air and household dust from houses located around a lead-acid battery repair shop. Such installations are one of the largest sources of lead exposure, since outdated technology is still used, coupled with the lack of strict air-quality control programs. Measurements of the air lead concentration around the repair shop were carried out ...

The main objective of this contribution was design of an application for control of expedition orders and administration of products for an arbitrary e-shop which has had implemented all necessary web services. The application communicates bi-directionally with the e-shop via these web services. A part of the work was also design of web services for an e-shop of one unnamed company. The applica...

The flexible job shop scheduling problem (FJSP) is one of the most difficult NP-hard combinatorial optimization problems. It is extremely difficult to solve the FJSP with the disturbances of manufacturing environment, which is always regarded as the flexible job shop online scheduling problem. This paper proposes a new method based on Process-Tree to solve this type of scheduling problem. Proce...

General job-shop scheduling is a difficult problem to be solved. The complexity of the problem is highlighted by the fact that in a general job-shop having m machines and n jobs the total number of schedules can be as high as (n!), hence if “n=20 m=10” the number of possible solutions is 7.2651x10. Many approaches such as Branch and Bound, Simulated Annealing, Tabu Search and others have been t...

Explosive growth in access to the Internet has created an unprecedented opportunity for the general public to acquire explicit erotic texts, images, services, and merchandise, but psychological scientists have not conceptualized antecedents or consequences of contact with Internet sexuality or conducted a significant amount of empirical research on these issues. The current analysis uses Intern...

Policy exploration for downtown revitalization gets becoming important in also Japan. This article deals with a modeling and simulation project of downtown visitors' shop-around behavior using an intelligent agent approach, by mainly devising and implementing planning (dynamic scheduling/ rescheduling), learning and adaptation functions. In this article, first, we explain the architecture of AS...