This paper presents a multi-objective mixed-integer nonlinear programming model to design a group layout of a cellular manufacturing system in a dynamic environment, in which the number of cells to be formed is variable. Cell formation (CF) and group layout (GL) are concurrently made in a dynamic environment by the integrated model, which incorporates with an extensive coverage of important ...

This paper introduces an Integer Programming model for multidimensional assignment problems and examines the underlying polytopes. It also proposes a certain hierarchy among assignment polytopes. The dimension for classes of multidimensional assignment polytopes is established, unifying and generalising previous results. The framework introduced constitutes the first step towards a polyhedral c...

Assembly lines appear with various differentiations in order to better include the disabled labor market and increase production efficiency. In this way, optimal workforce assignment problem that emerges heterogeneously is called assembly line worker balancing (ALWABP). This paper addresses ALWABP where simple version enriched by considering sequence-dependent setup times between tasks. A mixed...

This study considers a reliable location – inventory problem for a supply chain system comprising one supplier, multiple distribution centers (DCs), and multiple retailers in which we determine DCs location, inventory replenishment decisions and assignment retailers to DCs, simultaneously. Each DC is managed through a continuous review (S, Q) inventory policy. For tackling real world conditions...

This paper develops a mathematical model in dynamic virtual cellular manufacturing systems with the multiperiod cell formation problem, production planning, dynamic virtual system reconfiguration and training workers. Since workers have important role in doing jobs on machines, assignment of workers to cells becomes a crucial factor in cellular manufacturing system. Also we have shown the role ...

This paper addresses the common cycle multi-product lot-scheduling problem in flexible flow lines (FFL) where the product demands are deterministic and constant over a finite planning horizon. Objective is minimizing the sum of setup costs, work-in-process and final products inventory holding costs per time unite while satisfying the demands without backlogging. This problem consists of a combi...

Introduction: The two-sided matching model of Gale and Shapley (1962) can be interpreted as one where a non-empty finite set of firms need to employ a non-empty finite set of workers. Further, each firm can employ at most one worker and each worker can be employed by at most one firm. Each worker has preferences over the set of firms and each firm has preferences over the set of workers. An ass...

This paper proposes a system optimal dynamic traffic assignment model that does not require the network to be empty at the beginning or at the end of the planning horizon. The model assumes that link travel times depend on traffic densities and uses a discretized planning horizon. The resulting formulation is a nonlinear program with binary variables and a time-expanded network structure. Under...