Job Shop scheduling problem has significant importance in many researching fields such as production management and programming and also combined optimizing. Job Shop scheduling problem includes two sub-problems: machine assignment and sequence operation performing. In this paper combination of particle swarm optimization algorithm (PSO) and gravitational search algorithm (GSA) have been presen...

The incidence of cancer in 12,693 shipyard and machine shop male workers (1689 welders, 4308 platers, 6003 machinists, 693 pipe fitters) employed for at least one year between 1945 and 1960 was investigated in a retrospective cohort study. The welders had welded only mild steel and had not been exposed to hexavalent chromium containing fume. The follow up was 99.7% complete and the total number...

We study an inverse counterpart of the two machine flow-shop scheduling problem that arises in the context of inverse optimization. While in the forward scheduling problem all parameters are given and the objective is to find job sequence(s) for which the value of the makespan is minimum, in the inverse scheduling the exact values of processing times are unknown and they should be selected with...

One of the basic and significant problems, that a shop or a factory manager is encountered, is a suitable scheduling and sequencing of jobs on machines. One type of scheduling problem is job shop scheduling. There are different machines in a shop of which a job may require some or all these machines in some specific sequence. For solving this problem, the objective may be to minimize the makesp...

We consider a stochastic online scheduling environment, where jobs with stochastic processing requirements arrive over time and the objective is to minimize the total weighted completion time. We show that any nondelay algorithm is asymptotically optimal for the stochastic online single machine, flow shop and uniform parallel machine problems under some mild assumptions.

We present a scheduling problem of the flow-shop type. We introduce a transportation system: robot or conveyor. This transportation system is also involved in machine loading and unloading. The studied workshop consists of two machines and a conveyor that must process a set of tasks. Tasks having just been executed wait for the conveyor to be transported. The objective is to determine a feasibl...

Flexible job-shop scheduling problem (FJSSP) is an extension of the classical job-shop scheduling problem that allows an operation to be processed by any machine from a given set along different routes. It is very important in both fields of production management and combinatorial optimisation. This paper presents a new approach based on attribute oriented mining technique to solve the multi-ob...

In most cases, the effort required to develop a meaningful simulation for a small machine shop exceeds the resources available. Machine shops typically do not have staff with appropriate technical qualifications required to develop custom simulations of their operations. Furthermore, simulators are not designed to use traditional shop data in its native format, so models and data import routine...