Home > Information Control Problems in Manufacturing > 14th IFAC Symposium on Information Control Problems in Manufacturing
14th IFAC Symposium on Information Control Problems in Manufacturing
Information Control Problems in Manufacturing, Volume# 14 | Part# 1
Location: Hilton Conference Centre of Bucharest, Romania
National Organizing Committee Chair: Borangiu, Theodor;
Stocklosa, Iuliu
International Program Committee Chair: Dolgui, Alexandre;
Monostori, Laszlo;
Dumitrache, Ioan;
Pereira, Carlos Eduardo;
Vrba, Pavel
Conference Editor: Borangiu, Theodor;
Dolgui, Alexandre;
Dumitrache, Ioan;
Filip, Florin Gheorghe
ISBN: 978-3-902661-98-2
Start Date: 2012-05-23
End Date: 2012-05-25
| Paper Title | Authors | Updated | |
|---|---|---|---|
| Welcome and Introduction new | 2012-05-23 |
|
|
|
Authors: None
Abstract:
Keywords:
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.90001
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: ---
|
|||
| Contributions and Challenges in the Design of Production Systems new | Askin, Ronald | 2012-05-23 |
|
|
Authors: Askin, Ronald
Abstract:
Keywords: Inventory Control and Dynamic Pricing; Grouping and Sequencing Operations in Multi-Stage Systems
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00440
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 1-8
|
|||
| Product Intelligence: Theory and Practice new | McFarlane, Duncan Campbell | 2012-05-23 |
|
|
Authors: McFarlane, Duncan Campbell
Abstract:
Keywords: Intelligent Products and Lifecycle Management; Intelligent Manufacturing Systems
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00441
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 9-14
|
|||
| Production Systems Flexibility: Theory and Practice new | Chryssolouris, George; Georgoulias, Konstantinos; Michalos, George | 2012-05-23 |
|
|
Authors: Chryssolouris, George; Georgoulias, Konstantinos; Michalos, George
Abstract:
Keywords: Flexible Manufacturing Systems (FMS)
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00442
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 15-21
|
|||
| Past, Present and Future of Distributed Intelligent Control in Industrial Applications new | Vrba, Pavel | 2012-05-23 |
|
|
Authors: Vrba, Pavel
Abstract:
Keywords: Multi-Agent Systems and Heterarchical Topology for Manufacturing; Holonic Manufacturing Systems
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00443
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 22-25
|
|||
| Physical Internet Foundations new | Montreuil, Benoit; Meller, Russell; Ballot, Eric | 2012-05-23 |
|
|
Authors: Montreuil, Benoit; Meller, Russell; Ballot, Eric
Abstract:
Keywords: Physical Internet; Business Process Modeling
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00444
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 26-30
|
|||
| Manufacturing Integration Framework: A SOA Perspective on Manufacturing new | Morariu, Cristina; Borangiu, Theodor | 2012-05-23 |
|
|
Authors: Morariu, Cristina; Borangiu, Theodor
Abstract:
Keywords: Manufacturing System Engineering; Integration of Knowledge/Competence in Enterprise Modelling Framework
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00445
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 31-38
|
|||
| Service Innovation to Drive Chemical Operation Efficiency new | Puyosa, Hector | 2012-05-23 |
|
|
Authors: Puyosa, Hector
Abstract:
Keywords: Diagnostic and Optimization
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00446
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 39-43
|
|||
| Knowledge-Based Technologies for Future Factory Engineering and Control new | Legat, Christoph | 2012-05-23 |
|
|
Authors: Legat, Christoph
Abstract:
Keywords: Factory and Industrial Automation
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00447
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 44-48
|
|||
| Radio Frequency IDentification (RFID) in Supply Chain: Technology, Applications and Concerns new | Dolgui, Alexandre; Proth, Jean-Marie | 2012-05-23 |
|
|
Authors: Dolgui, Alexandre; Proth, Jean-Marie
Abstract:
Keywords: Supply Chain Coordination
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00448
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 49-56
|
|||
| Graphs with Maximal Induced Matchings of the Same Size new | Baptiste, Philippe; Kovalyov, Mikhail Y.; Orlovich, Yuri,... | 2012-05-23 |
|
|
Authors: Baptiste, Philippe; Kovalyov, Mikhail Y.; Orlovich, Yuri; Werner, Frank; Zverovich, Igor
Abstract: A graph is well-indumatched if all its maximal induced matchings are of the~same size. We first prove that recognizing the class WIM of well-indumatched graphs is a co-NP-complete roblem even for (2P_5, K_{1, 5})-free graphs. We then show that the well-known decision problems such as Independent Dominating Set, Independent Set, and Dominating Set are NP-complete for well-indumatched graphs. We also show that WIM is a co-indumatching hereditary class and characterize well-indumatched graphs in terms of forbidden co-indumatching subgraphs. However, we prove that recognizing co-indumatching subgraphs is an NP-complete problem. A graph G is perfectly well-indumatched if every induced subgraph of G is well-indumatched. We characterize the class of perfectly well-indumatched graphs in terms of forbidden induced subgraphs. Finally, we show that both Independent Dominating Set and Independent Set can be solved in polynomial time for perfectly well-indumatched graphs, even in their weighted versions, but Dominating Set is still NP-complete.
Keywords: Graph theory; Discrete Applied Mathematics
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00065
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 57-62
|
|||
| Near to Optimal Size Selection in Combinatorial Circuits new | Vakhania, Nodari; Werner, Frank | 2012-05-23 |
|
|
Authors: Vakhania, Nodari; Werner, Frank
Abstract: In this paper, we consider a problem of VLSI (very large scale integrated) design occurring in the routing phase. The problem is to determine the optimal size selection for the gates in a combinatorial circuit which uses the problem of finding a shortest path in an oriented acyclic graph for making certain updates between any two successive iterations. For this NP-hard problem, we give an approximation algorithm.
Keywords: Heuristic and Metaheuristics; Optimization and Control; Mathematical Approaches for Scheduling
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00060
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 63-68
|
|||
| A New Procedure for the Cyclic Job Shop Problem new | Fink, Martin; Ben Rahhou, Touria; Houssin, Laurent | 2012-05-23 |
|
|
Authors: Fink, Martin; Ben Rahhou, Touria; Houssin, Laurent
Abstract: The topic of this paper is the cyclic job shop problem, short CJSP, which aims at minimizing the cycle time under precedence and resource constraints. Based on graph theory, we propose a new branch and bound enumeration procedure to solve the CJSP. We compare the new procedure with other exact methods and present numerical test results.
Keywords: Mathematical Approaches for Scheduling; Branch and Bound; Capacity and Performance Evaluation
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00172
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 69-74
|
|||
| Effective Batch Scheduling with Sequence-Dependent Changeovers Using Reachability Analysis of Timed Automata Combined with Lower Bound Computations new | Schoppmeyer, Christian; Subbiah, Subanatarajan; Bendiganahalli-Deveerappa, Santhosh,... | 2012-05-23 |
|
|
Authors: Schoppmeyer, Christian; Subbiah, Subanatarajan; Bendiganahalli-Deveerappa, Santhosh; Engell, Sebastian
Abstract: In this contribution we discuss an extension of a recent approach to solve batch scheduling problems using reachability analysis for timed automata (TA) with embedded lower bound computations. We propose two bounding procedures embedded in the reachability algorithm to handle scheduling problems with sequence-dependent changeovers: (i) a MILP formulation (originally proposed by Manne 1960) extended with additional constraints to model setup and changeover operations and (ii) an improved minimum remaining processing time (MRPT) procedure. The efficiency of the proposed bounding procedures is evaluated on job shop problems with sequence-dependent changeovers. The comparative study shows that the MRPT-based bounding procedure is efficient and increases the overall performance significantly in comparison to the MILP-based bounding procedure.
Keywords: Mathematical Approaches for Scheduling; Graph theory; Branch and Bound
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00155
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 75-80
|
|||
| Search on an Enumeration Tree in Multiprocessor Job-Shop Problem new | Carballo, Lester; Lazarev, Alexander; Vakhania, Nodari,... | 2012-05-23 |
|
|
Authors: Carballo, Lester; Lazarev, Alexander; Vakhania, Nodari; Werner, Frank
Abstract: We present an approach on a two-stage filtration of the set of feasible solutions for multiprocessor job-shop scheduling problem. On the first stage, we use extensive dominance relations, whereas on the second stage we use lower bounds. We show that several lower bounds can efficiently be obtained and implemented.
Keywords: Branch and Bound; Mathematical Approaches for Scheduling; Discrete Applied Mathematics
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00414
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 81-86
|
|||
| Shifting Bottleneck Algorithm for Train Scheduling in a Single-Track Railway new | Gholami, Omid; Sotskov, Yuri | 2012-05-23 |
|
|
Authors: Gholami, Omid; Sotskov, Yuri
Abstract: A problem of train timetabling for a single-track railway is studied using a disjunctive graph model for the corresponding job-shop. The objective is to minimize the total weighted tardiness of the given trains. A shifting bottleneck algorithm is developed and tested to get a close to optimal schedule to the job-shop problem. At each iteration, this algorithm tries to minimize the total weighted tardiness of jobs (trains) with the given release times (departure times of the trains), the due dates, and the processing times on a single machine (single-track section between two stations). Since the latter problem is unary NP-hard, a heuristic procedure is used at each iteration of the shifting bottleneck algorithm. Computational results demonstrate the dependence of the CPU-time on the number of trains and single-track sections.
Keywords: Enterprise Resource Planning (ERP); Robust Scheduling; Scheduling Heuristics
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00374
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 87-92
|
|||
| Polynomial Algorithms for Scheduling Jobs with Two Processing Times on Unrelated Machines new | Werner, Frank; Vakhania, Nodari | 2012-05-23 |
|
|
Authors: Werner, Frank; Vakhania, Nodari
Abstract: We propose a polynomial-time algorithm that solves the problem of scheduling jobs with two possible processing times on unrelated machines with the objective to minimize the maximal job completion time.
Keywords: Mathematical Approaches for Scheduling; Optimization and Control
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00055
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 93-97
|
|||
| Mathematical Model and Lower Bounds for Multi Stage Jobshop Scheduling Problem with Special Blocking Constraints new | Gorine, Ali; Sauvey, Christophe; Sauer, Nathalie | 2012-05-23 |
|
|
Authors: Gorine, Ali; Sauvey, Christophe; Sauer, Nathalie
Abstract: This paper deals with multi stage jobshop scheduling problem. At each stage, either a fix or a variable number of identical parallel machines are available to execute jobs operations. As often in industrial environment, no space is available between machines, a specific RCb blocking constraint is taken into account. A linear integer mathematical model is proposed and executed in X-Press software to solve short size instances of this problem and to validate proposed model. In order to be able to evaluate future heuristics solutions quality, four lower bounds are proposed, computed and evaluated with benchmark for symmetric and asymmetric resources repartition cases.
Keywords: Mathematical Approaches for Scheduling; Integer Linear Programming; Scheduling Heuristics
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00299
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 98-104
|
|||
| An Optimal Static Priority Rule for Stochastic Scheduling with Impatience new | Salch, Alexandre; Gayon, Jean-Philippe; Lemaire, Pierre | 2012-05-23 |
|
|
Authors: Salch, Alexandre; Gayon, Jean-Philippe; Lemaire, Pierre
Abstract: In this paper we discuss scheduling problems with impatience to the beginning and to the end of service. The impatience of a job can be seen as a due date and processing times and due dates are random variables. Jobs are processed on a single machine with the objective to minimize the expected weighted number of tardy jobs in the class of static list scheduling policies. We derive optimal schedules when processing times and due dates are exponentially distributed.
Keywords: Stochastic Processes; Optimization and Control
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00139
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 105-110
|
|||
| Minimizing the Weighted Number of Late Semi-Resumable Jobs with Deterministic Machine Availability Constraints new | Detienne, Boris | 2012-05-23 |
|
|
Authors: Detienne, Boris
Abstract: We investigate the problem of minimizing the weighted number of tardy jobs on a single machine subject to availability constraints. We consider the case of semi-resumable jobs ($1,h_k|r_i,sr-a|sum w_iU_i$). We show that the problem is equivalent to a similar problem without availability constraints, but where the processing times of jobs are a stepwise function of their starting time. We design a Mixed Integer Linear Program (MILP) to model the problem and solve it with help of a commercial MILP solver. Computational experiments on randomly generated instances show that using this method allows solving optimally most $300$-job problems within $1000$ seconds, and provides excellent heuristic solutions in $100$ seconds.
Keywords: Mathematical Approaches for Scheduling; Integer Linear Programming
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00326
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 111-116
|
|||
| A Polynomially Solvable Case of a Single Machine Scheduling Problem When the Maximal Job Processing Time Is a Constant new | Werner, Frank; Vakhania, Nodari | 2012-05-23 |
|
|
Authors: Werner, Frank; Vakhania, Nodari
Abstract: We consider the problem of scheduling jobs with release times and due dates on a single machine to minimize the maximal job lateness. This problem is NP-hard, and its version when the job processing times are restricted to p,2p,3p,4p,..., for an integer p, is also NP-hard. We consider the case when the maximal job processing time is kp, for any constant k, and propose its polynomial-time solution. We easily establish that the version of this problem with unrestricted k is NP-hard. Moreover, it is strongly NP-hard if p has no exponential-time dependence on the maximal job due date. From a practical point of view, this is a realistic assumption.
Keywords: Mathematical Approaches for Scheduling; Optimization and Control
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00053
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 117-122
|
|||
| Metric and Approximated Solution of the Single Machine Total Tardiness Minimization Scheduling Problem new | Lazarev, Alexander; Korenev, Pavel | 2012-05-23 |
|
|
Authors: Lazarev, Alexander; Korenev, Pavel
Abstract: In this paper, we consider the NP-hard minimizing total tardiness on a single machine scheduling problem. We propose a metric for that problem and present a polynomial approximation scheme based on search for the polynomially solvable instance which has a minimal distance from an initial instance.
Keywords: Mathematical Approaches for Scheduling
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00297
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 123-126
|
|||
| A Graphical Approach to Solve Combinatorial Problems: Algorithms and Some Computational Results new | Gafarov, Evgeny R.; Lazarev, Alexander; Werner, Frank | 2012-05-23 |
|
|
Authors: Gafarov, Evgeny R.; Lazarev, Alexander; Werner, Frank
Abstract: In this paper, we present a modification of dynamic programming algorithms (DPA), which we denote as graphical algorithms (GrA). For some single machine scheduling problems, it is shown that the time complexity of the GrA is less than the time complexity of the standard DPA. Moreover, the average running time of the GrA is often essentially smaller. A GrA can also solve large-scale instances and instances, where the parameters are not integer. For some problems, GrA has a polynomial time complexity in contrast to a pseudo-polynomial complexity of a DPA.
Keywords: Mathematical Approaches for Scheduling; Dynamic Programming; Discrete Applied Mathematics
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00119
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 127-132
|
|||
| Multi-Section Hybrid Dynamical Scheduling of Flexible Manufacturing Systems new | Somlo, Janos; Rudas, Imre | 2012-05-23 |
|
|
Authors: Somlo, Janos; Rudas, Imre
Abstract: Abstract: The use of hybrid dynamical systems theory opens a new horizon for flexible manufacturing systems scheduling. It makes even possible directly connect scheduling and MRP. In the present paper the most important new result is the proposed demand rates determination method for multi-section scheduling problems. Some other important achievements making possible the application of this approach are discussed, too. These are, for example: feedback control law resulting stable (implementable with finite buffers) and regular ( converging to periodic) processes optimal demand rates determination for single- section problems Keywords: Flexible manufacturing systems; Scheduling; Hybrid dynamical systems; Single -sections; Multi-sections; Stability; Periodic regimes; Optimal demand rates; Buffers, Bottleneck, Automatic lot-streaming; Overlapping production;; Self-organizing; Distributed; Real-time control; MRP
Keywords: Flexible Manufacturing Systems (FMS); Scheduling Heuristics; Dynamic Systems
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00089
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 133-138
|
|||
| Calculation of the Stability Radius of an Optimal Line Balance new | Sotskov, Yuri; Werner, Frank; Zatsiupa, Aksana | 2012-05-23 |
|
|
Authors: Sotskov, Yuri; Werner, Frank; Zatsiupa, Aksana
Abstract: For an assembly line, it is necessary to minimize the cycle time for processing a partially ordered set of operations V = {1,..., n } on a set of m linearly ordered working stations. The number m of stations and the initial processing times t = (t_1, ..., t_n) of the operations V are given. However, for a subset of the manual operations, it is impossible to fix the processing times for the whole life cycle of the assembly line. On the other hand, for each automated operation, the processing time is fixed. We investigate the stability of an optimal line balance b_0 of the assembly line with respect to variations of the processing times. It is shown how to calculate the stability radius of an optimal line balance b_0, i.e., the maximal value of simultaneous independent variations of the processing times of the manual operations with keeping the optimality of the line balance b_0. We survey known results on the stability radius of an optimal line balance for a dual problem which is to minimize the number m of the working stations for the given cycle time.
Keywords: Robust Scheduling; Mathematical Approaches for Scheduling
Digital Object Identifier (DOI): 10.3182/20120523-3-RO-2023.00058
Conference: 14th IFAC Symposium on Information Control Problems in Manufacturing
Location: Hilton Conference Centre of Bucharest, Romania
Start Date: Wed May 23 2012 - End Date: Fri May 25 2012
Page Numbers: 139-144
|
|||