39 research outputs found
Bicriteria robotic operation allocation in a flexible manufacturing cell
Consider a manufacturing cell of two identical CNC machines and a material handling robot. Identical parts requesting the completion of a number of operations are to be produced in a cyclic scheduling environment through a flow shop type setting. The existing studies in the literature overlook the flexibility of the CNC machines by assuming that both the allocation of the operations to the machines as well as their respective processing times are fixed. Consequently, the provided results may be either suboptimal or valid under unnecessarily limiting assumptions for a flexible manufacturing cell. The allocations of the operations to the two machines and the processing time of an operation on a machine can be changed by altering the machining conditions of that machine such as the speed and the feed rate in a CNC turning machine. Such flexibilities constitute the point of origin of the current study. The allocation of the operations to the machines and the machining conditions of the machines affect the processing times which, in turn, affect the cycle time. On the other hand, the machining conditions also affect the manufacturing cost. This study is the first to consider a bicriteria model which determines the allocation of the operations to the machines, the processing times of the operations on the machines, and the robot move sequence that jointly minimize the cycle time and the total manufacturing cost. We provide algorithms for the two 1-unit cycles and test their efficiency in terms of the solution quality and the computation time by a wide range of experiments on varying design parameters. © 2009 Elsevier B.V. All rights reserved
Scheduling in flexible robotic manufacturing cells
Cataloged from PDF version of article.The focus of this thesis is the scheduling problems arising in robotic
cells which consist of a number of machines and a material handling robot.
The machines used in such systems for metal cutting industries are highly
flexible CNC machines. Although flexibility is the key term that affects
the performance of these systems, the current literature ignores this. As a
consequence, the problems considered in the current literature are either too
limiting or the provided solutions are suboptimal for the flexible systems. This
thesis analyzes different robotic cell configurations with different sources of
flexibility. This study is the first one to consider operation allocation problems
and controllable processing times as well as some design problems and bicriteria
models in the context of robotic cell scheduling. Also, a new class of robot
move cycles is defined, which is overlooked in the existing literature. Optimal
solutions are provided for solvable cases, whereas complexity analyses and
efficient heuristic algorithms are provided for the remaining problems.Gültekin, HakanPh.D
Two-machine flowshop scheduling with flexible operations and controllable processing times
Ankara : The Department of Industrial Engineering and the Graduate School of Engineering and Science of Bilkent University, 2011.Thesis (Master's) -- Bilkent University, 2011.Includes bibliographical references leaves 77-84.In this study, we consider a two-machine flowshop scheduling problem with identical
jobs. Each of these jobs has three operations, where the first operation must
be performed on the first machine, the second operation must be performed on
the second machine, and the third operation (named as flexible operation) can
be performed on either machine but cannot be preempted. Highly flexible CNC
machines are capable of performing different operations as long as the required
cutting tools are loaded on these machines. The processing times on these machines
can be changed easily in albeit of higher manufacturing cost by adjusting
the machining parameters like the speed of the machine, feed rate, and/or the
depth of cut. The overall problem is to determine the assignment of the flexible
operations to the machines and processing times for each job simultaneously,
with the bicriteria objective of minimizing the manufacturing cost and minimizing
makespan. For such a bicriteria problem, there is no unique optimum but a
set of nondominated solutions. Using ǫ constraint approach, the problem could
be transformed to be minimizing total manufacturing cost objective for a given
upper limit on the makespan objective. The resulting single criteria problem
is a nonlinear mixed integer formulation. For the cases where the exact algorithm
may not be efficient in terms of computation time, we propose an efficient
approximation algorithm.Uruk, ZeynepM.S
Bicriteria robotic cell scheduling
This paper considers the scheduling problems arising in two- and three-machine manufacturing cells configured in a flowshop which repeatedly produces one type of product and where transportation of the parts between the machines is performed by a robot. The cycle time of the cell is affected by the robot move sequence as well as the processing times of the parts on the machines. For highly flexible CNC machines, the processing times can be changed by altering the machining conditions at the expense of increasing the manufacturing cost. As a result, we try to find the robot move sequence as well as the processing times of the parts on each machine that not only minimize the cycle time but, for the first time in robotic cell scheduling literature, also minimize the manufacturing cost. For each 1-unit cycle in two- and three-machine cells, we determine the efficient set of processing time vectors such that no other processing time vector gives both a smaller cycle time and a smaller cost value. We also compare these cycles with each other to determine the sufficient conditions under which each of the cycles dominates the rest. Finally, we show how different assumptions on cost structures affect the results. © 2007 Springer Science+Business Media, LLC
Group Scheduling in a Cellular Manufacturing Shop to Minimise Total Tardiness and nT: a Comparative Genetic Algorithm and Mathematical Modelling Approach
In this paper, family and job scheduling in a cellular manufacturing shop is addressed where jobs have individual due dates. The objectives are to minimise total tardiness and the number of tardy jobs. Family splitting among cells is allowed but job splitting is not. Two optimisation methods are employed in order to solve this problem, namely mathematical modelling (MM) and genetic algorithm (GA). The results showed that GA found the optimal solution for most of the problems with high frequency. Furthermore, the proposed GA is efficient compared to the MM especially for larger problems in terms of execution times. Other critical aspects of the problem such as family preemption only, impact of family splitting on common due date scenarios and dual objective scenarios are also solved. In short, the proposed comparative approach provides critical insights for the group scheduling problem in a cellular manufacturing shop with distinctive cases
Efficient heuristics for the parallel blocking flow shop scheduling problem
We consider the NP-hard problem of scheduling n jobs in F identical parallel flow shops, each consisting of a series of m machines, and doing so with a blocking constraint. The applied criterion is to minimize the makespan, i.e., the maximum completion time of all the jobs in F flow shops (lines). The Parallel Flow Shop Scheduling Problem (PFSP) is conceptually similar to another problem known in the literature as the Distributed Permutation Flow Shop Scheduling Problem (DPFSP), which allows modeling the scheduling process in companies with more than one factory, each factory with a flow shop configuration. Therefore, the proposed methods can solve the scheduling problem under the blocking constraint in both situations, which, to the best of our knowledge, has not been studied previously. In this paper, we propose a mathematical model along with some constructive and improvement heuristics to solve the parallel blocking flow shop problem (PBFSP) and thus minimize the maximum completion time among lines. The proposed constructive procedures use two approaches that are totally different from those proposed in the literature. These methods are used as initial solution procedures of an iterated local search (ILS) and an iterated greedy algorithm (IGA), both of which are combined with a variable neighborhood search (VNS). The proposed constructive procedure and the improved methods take into account the characteristics of the problem. The computational evaluation demonstrates that both of them –especially the IGA– perform considerably better than those algorithms adapted from the DPFSP literature.Peer ReviewedPostprint (author's final draft
Robotic assembly line design with tool changes
Ankara : The Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent University, 2009.Thesis (Master's) -- Bilkent University, 20009Includes bibliographical references leaves 57-58.This thesis is focused on assembly line design problems in robotic cells. The
mixed-model assembly line design problem that we study has several subproblems
such as allocating operations to the stations in the robotic cell and satisfying
the demand and cycle time within a desired interval for each model to be produced.
We also ensure that assignability, precedence and tool life constraints are
met. The existing studies in the literature overlook the limited lives of tools that
are used for production in the assembly lines. Furthermore, the studies in the
literature do not consider the unavailability periods of the assembly lines and
assume that assembly lines work 24 hours a day continuously. In this study, we
consider limited lives for the tools and hence we handle tool change decisions. In
order to reflect a more realistic production environment, we deal with designing
a mixed-model assembly line that works 24 hours a day in three 8-hour shifts
and we consider lunch and tea breaks that are present in each shift. This study
is the first one to propose using such breaks as tool change periods and hence
eliminate tool change related line stoppages. In this setting, we determine the
number of stations, operation allocations and tool change decisions jointly. We
provide a heuristic algorithm for our problem and test the performances of our
heuristic algorithm and DICOPT and CPLEX solvers included in GAMS software
on different instances with varying problem parameters.Tula, AdnanM.S
Department of Computer Science Activity 1998-2004
This report summarizes much of the research and teaching activity of the Department of Computer Science at Dartmouth College between late 1998 and late 2004. The material for this report was collected as part of the final report for NSF Institutional Infrastructure award EIA-9802068, which funded equipment and technical staff during that six-year period. This equipment and staff supported essentially all of the department\u27s research activity during that period