Search

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2005.06.078 Byline: Satyaveer S. Chauhan (a), Valery Gordon (b), Jean-Marie Proth (c) Keywords: WIP; Scheduling; No-wait Abstract: Successful companies are those that reach at least the two following objectives: reduce their Work-In-Process (WIP) and respond to customer's requirements in real time. The approach proposed in this paper allows to reach these goals by controlling the WIP and providing information about the completion times of customer's demands in real time. The approach we develop in this paper has been integrated in a supply chain environment for flow-shops. This paper extends the approach to assembly systems. Author Affiliation: (a) Bordeaux School of Management, Talence, France (b) National Academy of Sciences, Minsk, Belarus (c) INRIA-SAGEP, UFR Science, Universite de Metz, Ile du Saulcy, 57045 Metz, France Article History: Received 15 October 2004; Accepted 15 June 2005

The scheduling of real-time in minimizing the delays from a single source is examined.

Byline: Cyril Duron (1), Jean-Marie Proth (1) Keywords: Feature selection; [chi].sup.2 analysis; data mining; diagnosis; statistics Abstract: This paper addresses the 0--1 outcome feature selection problem. In such a problem, a set of features leads to an outcome that is 0 or 1, depending upon the values of the features. The aim is to extract subsets of features that characterize at best outcome 1. This kind of problem arises in medical analysis, quality control and, generally, in any domain that requires series of expensive tests to evaluate the state of a system. Author Affiliation: (1) INRIA/SAGEP, UFR Scientifique, Universite de Metz, Ile du Saulcy, 57000, Metz, France Article History: Registration Date: 30/09/2004

Application of heuristics to formulate algorithm for ascertaining cost of material supplied by various manufacturers to single customer, for fulfilment of preexisting demand, is described.

In this paper, the expression "production systems" refers to flow shops, job shops, assembly systems, Kanban systems, and, in general, to any discrete event system which transforms raw material and/or components into products and/or components. Such a system is said to be cyclic if it provides the same sequence of products indefinitely. A schedule of a cyclic production system is defined as soon as the starting time of each operation on the related resource is known. It has been shown that, whatever the feasible schedule applied to the cyclic production system, it is always possible to fully utilize the bottleneck resource. In other words, it is always possible to maximize the throughput of such a system. As a consequence, we aim at finding the schedule which permits to maximize the throughput with a work in process as small as possible. We propose a heuristic approach based on Petri nets to find a near-optimal, if not optimal, solution. We also give a sufficient condition for a solution to be optimal. Index Terms--Cyclic production systems, event graphs, Petri nets, scheduling, work in process (WIP).

A unified framework for addressing common due date assignment and scheduling problems is presented by surveying available operations research literature.

Two dynamic programming-based heuristic methods were suggested to solve different types of industrial cutting stock problems. The HCUS (Heuristic Constraining the Utilisation of the Stored Bars) method is utilized in the sales department, where the time to present a solution is more important than the quality of the solution. The HCUSO (Heuristic Constraining the Utilisation of Stored and Ordered Bars) method, however, focuses on the quality of the solution over time.

A class of Petri nets called Controllable-Output nets or CO nets was utilized to model schedulling in a manufacturing system. The CO nets allows the introduction of a two-stage scheduling algorithm for problems with piecewise constant product flows. The algorithm introduced involves the division of workload among resources and creation of a schedule based on resource workload.

This paper proposes a model and a related algorithm for generating optimal cyclic schedules of hoist moves with time window constraints in a printed circuit board (PCB) electroplating facility. The algorithm is based on the branch and bound approach and requires the solution of a specific class of linear programming problems (LPP's). These LPP's are equivalent to the problems of the cycle time evaluation in hi-valued graphs. Computational experience is presented to compare the results obtained using this new algorithm with the ones proposed in the literature. Index Terms - Bi-valued graph, branch-and-bound, cycle time, hoist scheduling, time window constraints.

Development of heuristics was undertaken to resolve office scheduling problem. Two assignment heuristics created showed effectiveness in terms of assigning tasks to employees and scheduling assigned tasks to resolve previously identified limitations. A developed intuitive heuristic, meanwhile, proved to be efficient in directly creating a viable schedule. A simulated annealing strategy was also employed in scheduling assigned tasks.

This paper introduces a class of Petri nets which are reversible, live, and can be kept bounded. Furthermore, these Petri nets have output transitions that can be fired independently from each other. These properties are required when modeling manufacturing systems. Another important property is that the integration of models which belong to this class of Petri nets still belongs to the same class, assuming that the integration is performed following rules which reflect common manufacturing practice. As a result, the qualitative properties of the module models are preserved. The results obtained in this paper are expected to shed light on the design, management and control of large scale manufacturing systems since modular approach is a way to cope with complexity. Index Terms - Integration, manufacturing systems, Petri nets.

An important step when designing a flexible manufacturing system (FMS) using automated guided vehicles (AGV's) is the definition of the number of AGV's to be used in order to reach a given productivity. A way to define this number is to consider several scenarios, to define the minimal number of AGV's required by each scenario, and to keep the maximal of these numbers. In this paper, we propose a branch and bound (B&B) approach to define the minimal number of AGV's required for a scenario. This approach is based on an event graph (EG) formulation. Index Terms - Automated guided vehicles, event graphs, flexible manufacturing systems, modeling, optimization, Petri nets, transportation systems.