نتایج جستجو برای: open shop with no buffer

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

Journal: :European Journal of Operational Research 2008
Heidemarie Bräsel André Herms Marc Mörig Thomas Tautenhahn Jan Tusch Frank Werner

In this paper, we consider the problem of scheduling n jobs on m machines in an open shop environment so that the sum of completion times or mean flow time becomes minimal. For this strongly NP-hard problem, we develop and discuss different constructive heuristic algorithms. Extensive computational results are presented for problems with up to 50 jobs and 50 machines, respectively. The quality ...

Journal: :TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C 1983

Journal: :Math. Meth. of OR 2003
Joachim Breit Günter Schmidt Vitaly A. Strusevich

We study a two-machine open shop scheduling problem, in which the machines are not continuously available for processing. No preemption is allowed in the processing of any operation. The objective is to minimize the makespan. We consider approximability issues of the problem with more than one non-availability interval and present an approximation algorithm with a worst-case ratio of 4/3 for th...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور - دانشگاه پیام نور مرکز - دانشکده زبانهای خارجی 1391

the primary goal of the current project was to examine the effect of three different treatments, namely, models with explicit instruction, models with implicit instruction, and models alone on differences between the three groups of subjects in the use of the elements of argument structures in terms of toulmins (2003) model (i.e., claim, data, counterargument claim, counterargument data, rebutt...

2008
Alexandra Politou Patroklos Georgiadis

This paper aims to introduce System Dynamics (SD) in applying Drum Buffer Rope (DBR) methodology of Theory of Constraints (TOC) in a three-stage flow shop system that produces a single product. To the best of our knowledge, although there are a lot of TOC applications using discrete simulation in production scheduling with DBR methodology, there are not any TOC application of DBR methodology in...

2004
A. V. Sleptchenko

In this paper we consider a repair shop location problem with uncertainties in demand. New local 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, a (small) inventory of working items is kept at the repair shops. A c...

2017
Hendrik Scholta Willem Mertens Angela Reeve Marek Kowalkiewicz

This paper responds to two observations regarding current government service delivery. First, despite reasonable efforts to improve the design of forms and to establish single points of contacts in the course of one-stop-shops, citizens still perceive forms as cumbersome. Second, citizens expect governments to act more proactively by initiating relevant government services themselves instead of...

Journal: :journal of modern processes in manufacturing and production 2014
abolfazl adressi reza bashirzadeh vahid azizi saeed tasouji hassanpour

different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. conventional productionmethods are constantly subs...

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

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