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

Parallel machines scheduling problem is a branch of production scheduling, which is among the most difficult combinatorial optimization problems. This paper develops a meta-heuristic algorithm based on the concept of the vibration damping in mechanical vibration, called vibration damping optimization (VDO) algorithm for optimizing the identical parallel machine scheduling problem with sequence-...

A mathematical programming model for a class of single machine family scheduling problems is described in this technical report, with the aim of comparing the performance in solving the scheduling problem by means of mathematical programming with the performance obtained when using optimal control strategies, that can be derived from the application of a dynamic programming-based methodology pr...

The present paper, titled “optimizing the time of preparation, taking into account the timing of   repair and maintenance using non-linear modeling”, has been implemented with the aim of designing and presenting a mathematical model to get the best sequence of operations leading to minimum the total time of production. The main research question is related to the reduction of time and productio...

This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...

Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...

In this paper, we consider the M/G/k queueing system with setup times. This particular queueing model is common in manufacturing systems, where idle machines are turned off to save on operating costs, as well as in server farms, where idle servers are turned off to conserve power. While recent literature has analyzed the M/M/k system with exponential setup times, no closedform solutions were ob...

this paper deals with the single machine multi-product lot scheduling problem in which defective items are produced in any production run of each product. we have adopted the common cycle scheduling policy and assumed that the setup times for production of each product can be non-zero. further, we have assumed that defective items will be reworked and the inspection costs during the normal prod...

In this paper we consider the problem of scheduling jobs on parallel machines with setup times. The setup has to be performed by a single server. The objective is to minimize the schedule length (makespan) as well as the forced idle time. The makespan problem is known to be NP -hard even for the case of two identical parallel machines. This paper presents a pseudopolynomial algorithm for the ca...

Setup operations are significant in some production environments. It is mandatory that their production plans consider some features, as setup state conservation across periods through setup carryover and crossover. The modelling of setup crossover allows more flexible decisions and is essential for problems with long setup times. This paper proposes two models for the capacitated lot-sizing pr...