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

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

This paper proposes a hybridized simheuristic approach that couples greedy randomized adaptive search procedure (GRASP), Monte Carlo simulation, Pareto archived evolution strategy (PAES), and an analytic hierarchy process (AHP), in order to solve multicriteria stochastic permutation flow shop problem with processing times sequence-dependent setup times. For the decisional criteria, proposed con...

the problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. almost all of the researches in this area assumed that setup times and costs are sequence –independent even though sequence dependent setups are common in practice. in this paper we present a new mixed integer non linear program (minlp) and a heuristic meth...