...Donald C. Kerr; Jaydeep Balakrishnan Many algorithms have been proposed to form manufacturing cells from component routeings. Most of these methods require specialized algorithms for implementation. Some others use well known procedures such as integer programming. However, these may be difficult...

... approaches assume only one copy of a machine type for allocation. This model allows for more than one copy of a machine type. While many approaches use a general integer programming package to solve the group technology problem, proposes a two‐stage procedure based on A* algorithm. Computational experience...

...Gündüz Ulusoy; Linet Özdamar Proposes a heuristic iterative scheduling algorithm for the resource constrained project scheduling problem. Considers a general model where activities are represented by multiple operating modes and each operating mode is constituted of different activity durations...

.... Algorithms Jobbing production Job shop Modelling Scheduling IJOPM 13,11 JOB: An Instructive Job Shop Scheduling Environment 4 Received September 1992 Accepted January 1993 James M. Pruett Louisiana State University, Baton Rouge, USA, and Andreas Schartner SPACE, GmbH, Hanover, Germany Introduction...

... by Pritsker et al.[4]. Rather than solving their formulation directly, Patterson and Huber suggested two exact bounding algorithms, a minimum bounding algorithm and a maximum bounding algorithm, that examine the feasibility of a series of 0-1 programming problems. The minimum bounding algorithm starts...

..., in addition,they cannot take into account the wide variety of cost and other factors that influence inventory control decisions. Presents an alternative method for identifying economic batch quantities that uses genetic algorithms (GA) based on the underlying mathematical processes that control...

...Y.Y. Lee; B.A. Kramer; C.L. Hwang Most of the literature published regarding the performance of lot‐sizing algorithms has been in a deterministic environment. The first objective of this article is to propose a way to incorporate fuzzy sets theory into lotsizing algorithms for the case of uncertain...

... model. This is based on an algorithm for dynamically selecting the best despatching rule according to the current system status. Comparison between simulation runs with and without dynamic rule despatching shows that the proposed algorithm gives a better overall performance. Production management...

...Byung‐Suh Kang; Robert E. Markland The no‐intermediate storage flowshop scheduling problem is investigated. Six algorithms for solving this problem are developed and evaluated in terms of the quality and efficiency of the solutions they produce. Comparative test results from the application...