نتایج جستجو برای: shop

تعداد نتایج: 11410  

2007
Louis Kaplow Steven Shavell Guhan Subramanian Leo Strine Ranjan Ahuja

Go-shop provisions have changed the way in which private equity firms execute public-company buyouts. While there has been considerable practitioner commentary on go-shops in the three years since they first appeared, this paper presents the first systematic empirical evidence on this new dealmaking technology. Contrary to the claims of prior commentators, I find that: (1) goshops yield more se...

Journal: :Computers & OR 2006
Jan-Kees C. W. van Ommeren Adriana Felicia Gabor Andrei Sleptchenko

In this paper we consider a repair shop location problem with uncertainties in demand. New repair shops have to be opened at a number of locations. At these local repair shops, customers arrive with broken, but repairable, items. Customers go to the nearest open repair shop. Since they want to leave as soon as possible, an inventory of working items is kept at the repair shops. A customer immed...

2011
J M J Schutten

We consider the problem of scheduling jobs in a hybrid job shop We use the term hybrid to indicate that we consider a lot of extensions of the classic job shop such as transportation times multiple resources and setup times The Shifting Bottleneck procedure can be generalized to deal with those extensions We test this approach for an assembly shop In this shop we study the in uence of static an...

2007
Brian Mayer

This pilot project assessed the feasibility of Cellular Manufacturing at a ship maintenance facility. Using the PFAST software, several potential families of repair jobs, and the appropriate cluster of shops for each family, were identified. Based on these results, it was decided to implement a Focused Factory to complete any repair job done by the Dive Shop. The Dive Shop would be merged with ...

2005
ANTÓNIO FERROLHO

In this paper, scheduling problems in Flexible Manufacturing Cells (FMC) are studied. The scheduling objective is to minimize the makespan. We used a genetic algorithm (GA) for solving the optimization scheduling problem. We have developed one FMC with industrial characteristics with the objective of studying scheduling problems in these types of manufacturing systems (single machine scheduling...

2013
Masao Ohta Yoshiyuki Higuchi

This study analyses store layout among the many factors that underlie supermarket store design, this; in terms of what to display in a shop and where to place the items. This report examines newly-opened stores and evaluates their interior shop floor layouts, which we then attempt to categorize by various styles. We then consider the interaction between shop floor layout and customer behavior f...

Journal: :European Journal of Operational Research 2006
George J. Kyparisis Christos Koulamas

We consider the multistage flexible flow shop scheduling problem with uniform parallel machines in each stage and the objective of minimizing makespan. We develop a general class of heuristics for this strongly NP-hard problem that extend several well-known heuristics for the corresponding embedded serial flow shop problem, and obtain absolute performance guarantees for heuristics in this class...

Journal: :Simulation 2005
Dug Hee Moon Cheng Song Jae Hoon Ha

This article introduces a simulation study relating to the dynamic operating algorithm for the painted body storage (PBS) in an automotive factory. The manufacturing process in the trim shop of an automotive factory is a typical example of the mixed-model assembly production. In the paint shop, which comes before the trim shop, same-colored bodies are grouped together to reduce the changeover c...

2006
Tina Lee

Modelling and simulation technology is recognized for facilitating training, reducing production cost, improving product quality, and shortening development time. However, this technology remains largely underutilized by industry today. This is because custom simulator development is complex and costly, and custom translators are needed to run commercial simulation software. Information models ...

2015
Kameng Nip Zhenbo Wang Wenxun Xing

We consider several combinatorial optimization problems which combine the classic shop scheduling problems, namely open shop scheduling or job shop scheduling, and the shortest path problem. The objective of the obtained problem is to select a subset of jobs that forms a feasible solution of the shortest path problem, and to execute the selected jobs on the open (or job) shop machines to minimi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید