We consider an M/G/∞ model with exponentially distributed setup times. Arrivals result in an off server starting a setup. Upon completing a setup, a server begins serving a waiting customer. Upon completing service, with probability p the server becomes eligible to serve another waiting customer. Among other things, we show, in steady state, that the number of busy servers is Poisson distribute...

Setup operations play an important role in many production environments. In this paper, the exact modeling of setup times is motivated and two mixed integer programming model formulations are proposed. These model formulations allow the representation of ‘‘long’’ setup times with respect to the length of a planning period, which are widespread in process industries. Computational results unders...

We study a scheduling problem in which jobs may be split into parts, where the parts of a split job may be processed simultaneously on more than one machine. Each part of a job requires a setup time, however, on the machine where the job part is processed. During setup, a machine cannot process or set up any other job. We concentrate on the basic case in which setup times are job-, machineand s...

In this paper we consider microfactories for manipulation and assembly. These microfactories are composed of several cells containing microrobotic systems capable of a high level of repeatability. The assembly plan of the production is a pipeline of tasks that are performed by the cells. Our aim is to manage the production flow in the case where the cells can be reconfigured to perform differen...

In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...

The flowshop scheduling problem with sequence dependent setup times is considered and shown to be NP-complete. A traveling salesman problem formulation is proposed for the case where jobs are processed continuously through the shop. These results are used to describe an approximate algorithm for the case where limited or infinite intermediate storage space is available to hold partially complet...

With the development of Industry 4.0 and requirement smart factory, cellular manufacturing system (CMS) has been widely concerned in recent years, which may leads to reducing production cost wip inventory due its flexibility with groups. Intercellular transportation consumption, sequence-dependent setup times, batch issue CMS are taken into consideration simultaneously this paper. Afterwards, a...

The two-stage hybrid flow shop problem under setup times is addressed in this paper. This NP-Hard. on the other hand, studied modeling different real-life applications especially manufacturing and high performance-computing. Tackling kind of requires development adapted algorithms. In context, a metaheuristic using genetic algorithm three heuristics are proposed These approximate solutions opti...