In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...

Production planning is performed through diverse methods according to the type of the system it is structured upon. One of the most important steps before production planning is to determine which system best fits the firm, and how the facilities should be designed. Both job-shop and group-technology systems have their own pros and cons, each of which is suitable to a specific kind of factory. ...

Production planning is performed through diverse methods according to the type of the system it is structured upon. One of the most important steps before production planning is to determine which system best fits the firm, and how the facilities should be designed. Both job-shop and group-technology systems have their own cons and pros, each of which is suitable to a specific kind of factory. ...

Sociologists and anthropologists recognise the 'face to face' group ?in which all the individuals meet each other in the course of the day's activities?as a primary group in all types of human society. This kind of group is similar to that which exists in sub-human primates. In a small human society, relationships tend to be personal and it matters a great deal more who a man is than what he do...

As a well-known NP-hard problem, the dynamic job shop scheduling problem has significant practical value, so this paper proposes an Improved Heuristic Kalman Algorithm to solve problem. In Algorithm, cellular neighbor network is introduced, together with boundary handling function, and best position of each individual recorded for constructing network. The encoding method introduced based on re...