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

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

2010
Stephan Dempe Heiner Schreier Roger Behling Andreas Fischer

The concept of irreducibility in shop scheduling problems withdifferent objectives has proven one of the most fertile research topics as theset of all irreducible sequences in a given shop contains at least one optimalsequence for arbitrary processing times. Recently, a number of equivalent for-mulations of the reducibility in open-shop problem with Makespan objectivesare pr...

2012
Tadeusz Witkowski

In the paper we discuss the influence of the route flexibility degree, the open rate of operations and the production type coefficient on makespan. The flexible job-open shop scheduling problem FJOSP (an extension of the classical job shop scheduling) is analyzed. For the analysis of the production process we used a hybrid heuristic of the GRASP (greedy randomized adaptive search procedure) wit...

Journal: :CoRR 2013
V. Ravibabu

This paper represents the metaheuristics proposed for solving a class of Shop Scheduling problem. The Bacterial Foraging Optimization algorithm is featured with Ant Colony Optimization algorithm and proposed as a natural inspired computing approach to solve the Mixed Shop Scheduling problem. The Mixed Shop is the combination of Job Shop, Flow Shop and Open Shop scheduling problems. The sample i...

2011
D. Y. Sha Hsing-Hung Lin

Multi-objective open-shop scheduling is definitely significant in practical. However, the research focused on multi-objective open-shop scheduling was relatively scarce. This article proposed a particle swarm optimization to address open-shop scheduling problems with multiple objectives. Originally, particle swarm optimization was invented to treat continuous optimization problems. In this pape...

1996
Edward J. Williams Igal Ahitov

We describe a production shop which needed to undertake schedule analyses at the macro level of planning and explain the methods of using simulation to obtain valid, credible schedule analyses quickly. After discussion of the simulation model itself we present actual simulation results and conclusions. These successful simulation results help the production shop attain nimble adaptation to prod...

Journal: :Expert Syst. Appl. 2015
Andrea Rossi Sauro Soldani Michele Lanzetta

The proposed hybrid stage shop scheduling (HSSS) model, inspired from a real case in the high-fashion industry, aims to fully exploit the potential of parallel resources, splitting and overlapping concurrent operations among teams of multifunctional machines and operators on the same job. The HSSS formally extends mixed shop scheduling (a combination of flowshop and open shop), which is able to...

Journal: :J. Scheduling 2012
Dvir Shabtay Yaron Bensoussan

The problem of maximizing the weighted number of just-in-time jobs in a two-machine ‡ow shop scheduling system is known to be NP-hard [4]. However, the question of whether this problem is strongly or ordinary NP-hard remains an open question. We provide a pseudo-polynomial time algorithm to solve this problem, proving that it is NP-hard in the ordinary sense. Moreover, we show how the pseudo-po...

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

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