in this paper, a genetic algorithm is presented for an identical parallel-machine scheduling problem with family setup time that minimizes the total weighted flow time ( ). no set-up is necessary between jobs belonging to the same family. a set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i  j, the duration of this set-up being the sequ...

This paper presents the idea of creating cells while reducing part-level sequence-dependent setup time in general cellular manufacturing systems (CMS). Setup time reduction in CMS has gained modest attention in the literature. This could be attributed to the fact that the fundamental problem in cell formation in CMS has been mainly related to material handling and machine utilization while setu...

in this paper, the study deals with the lead time and setup reduction problem in the vendor-purchaser integrated inventory model. the cost of capital (i.e., opportunity cost) is one of the key factors in making the inventory and investment decisions. lead time is an important element in any inventory system. the proposed model is presents an integrated inventory model with controllable lead tim...

in this paper, based on the background of cost-oriented assembly line balancing problems, a novel mathematical model for scheduling and balancing the assembly line is offered that with the combination of task sequence-dependent setup time, parallel stations and resource constraint, minimizes the operational and investment costs of assembly system. due to the complexity of the problem, the equat...

this paper explores the flexile flow lines where setup times are sequence- dependent. the optimization criterion is the minimization of total weighted completion time. we propose an iterated greedy algorithm (iga) to tackle the problem. an experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of iga are compared against those of some other exist...

nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. in some of the applications of unrelated parallel mac...

This paper introduces a new notion related to the traveling salesperson problem (TSP) — the notion of the TSP ratio. The TSP ratio of a TSP instance I is the sum of the marginal values of the nodes of I divided by the length of the optimal TSP tour on I, where the marginal value of a node i ∈ I is the difference between the length of the optimal tour on I and the length of the optimal tour on I...