Reactive scheduling is often been criticized for its inability to provide timely optimized and stable schedules. So far, the extant literature has focused on generating schedules that optimize shop floor efficiency. Only a few have considered optimizing both shop floor efficiency and schedule stability. This paper applies a unique selfadaptation mechanism of the ant colony optimization (ACO) al...

We study an optimization aspect of Internet shopping with price sensitive discounts from customer perspective (which is a specific case of the Internet Shopping Optimization Problem [1, 5]). Specifically, we consider a problem in which a customer would like to buy products of a given set N = {1, . . . ,n} in a given set of Internet shops M = {1, . . . ,m} at the minimum total final price. There...

In this article we present an Ant Colony Optimization approach to the Flow Shop Problem. ACO is a new algorithmic approach, inspired by the foraging behavior of real ants, that can be applied to the solution of combinatorial optimization problems. Artificial ants are used to construct solutions for Flow Shop Problems that subsequently are improved by a local search procedure. Comparisons with o...

In this paper we study specially structured two stage flow shop scheduling problem with jobs in a string of disjoint job blocks having sequence independent setup times separated from processing times each associated with their respective probabilities including job weightage. In flow shop scheduling optimization of elapsed time may not always result in optimization of utilization time. Here, th...

This research introduces three heuristic algorithms for solving job-shop scheduling problems, job-shop scheduling problems with multi-purpose machines, and open-shop scheduling problems. All these algorithms are based on the particle swarm optimization algorithm, and generate solutions that belong to the class of parameterized active schedules via their specific decoding procedures. Comparison ...

this paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. the fuzzy set theory is applied to describe this situation. a novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. due to the computational complexities, the prop...

Online shop is an online shopping system where transactions that occur between sellers and buyers are entirely carried out online, this certainly gives a change to the in era of technology, technological developments provide benefits humans with innovations occur, shops emerge which become business fields make it easier for community when necessities. Currently, people more dominant becauseit p...

Background. Psittacosis is category B bioterrorism disease. Here we present a cluster outbreak in Belgium and the steps taken by the authorities to prevent further spread. Methods. In July 2013 a husband a wife, both 54 years old, presented at our department with a history of fever and dry cough since five days. Laboratory test showed strongly elevated inflammation parameters. Chest X-ray confi...

This paper proposes a distributed manufacturing scheduling framework at the shop floor level. The shop floor is modeled as a collection of multiple workcells, each of which is modeled as a flexible manufacturing system. The framework consists of a distributed shop floor control structure, dynamic distributed scheduling algorithms, multi-agent system modeling of workcell, and service oriented in...

The use of random test problems to evaluate algorithm performance raises an important, and generally unanswered, question: Are the results generalizable to more realistic problems? Researchers generally assume that algorithms with superior performance on diÆcult, random test problems will also perform well on more realistic, structured problems. Our research explores this assumption for the per...