Determinants of Decentralization within the Firm: Some Empirical Evidence from Spanish Small and Medium- Sized Enterprise

This paper examines empirically the determinants of decentralization of decision- making in the firm for small and medium-sized enterprises (SMEs) that tend to be highly centralized. By decentralization of decisions we mean the delegation of decision rights from the owner or manager to the plant supervisor or even to floor workers. Our findings show that the allocation of authority to basic workers or a team of workers depends on firm characteristics such as firm size, the use of internal networks or the number of workplaces, and workers characteristics, in particular, the composition of the laborforce in terms of education and seniority and whether or not workers receive pay incentives. External factors such as the intensity of competition and the firm s export intensity are also important determinants of the allocation of authority.

Sistema d'AGV (vehicles-robot de guiatge automàtic) per a magatzems i plantes de manufactura

Una de les solucions per a minimitzar els costos de producció o d'emmagatzematge és automatitzarne la logística interna. Per dissenyar les aplicacions corresponents és convenient poder validar-les amb un prototipatge. Això ha motivat la realització d'aquest projecte, on s'ha obtingut un prototip d'AGV (automated guided vehicle) que rep les ordres per Bluetooth i, mitjançant uns infrarojos per poder seguir unes línies al terra, és capaç d'anar des del punt inicial fins on se li ha encarregat i tornar al punt inicial. Aquest vehicle pot servir de base per a la implementació d'AGV orientats a aplicacions reals i, per tant, per a la construcció de sistemes més grans i que poden ser utilitzats en plantes de producció, laboratoris, magatzems, ports i d'altres aplicacions diverses.

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

Optimised search heuristic combining valid inequalities and tabu search

This paper presents an Optimised Search Heuristic that combines a tabu search method with the verification of violated valid inequalities. The solution delivered by the tabu search is partially destroyed by a randomised greedy procedure, and then the valid inequalities are used to guide the reconstruction of a complete solution. An application of the new method to the Job-Shop Scheduling problem is presented.

Solving two production scheduling problems with sequence-dependent set-up times

In today’s competitive markets, the importance of goodscheduling strategies in manufacturing companies lead to theneed of developing efficient methods to solve complexscheduling problems.In this paper, we studied two production scheduling problemswith sequence-dependent setups times. The setup times areone of the most common complications in scheduling problems,and are usually associated with cleaning operations andchanging tools and shapes in machines.The first problem considered is a single-machine schedulingwith release dates, sequence-dependent setup times anddelivery times. The performance measure is the maximumlateness.The second problem is a job-shop scheduling problem withsequence-dependent setup times where the objective is tominimize the makespan.We present several priority dispatching rules for bothproblems, followed by a study of their performance. Finally,conclusions and directions of future research are presented.