基于合同网协议交互投标的动态调度方法研究

柔性制造系统使生产加工路径有很多可选性,所以调度系统必须考虑机器调度问题。分配规则调度是一种最基本、最具影响力的动态调度方法。然而,分配规则调度方法很少考虑机器顺序选择。兼顾工件选择和机器选择两方面,本文运用交互投标过程,构建基于合同网协议调度的协商规则。研究作业车间动态调度问题,提出并构建了5种合同网规则调度方法。通过实验分析结果表明,基于合同网交互投标模式的规则调度能够大大改善调度系统性能,提高设备的利用率和设备负荷平衡指标。

基于多代理和规则调度的敏捷调度系统研究

研究了在敏捷制造环境下制造车间生产过程的动态调度问题。针对敏捷化调度的特殊要求 ,提出了综合运用多代理机制与规则调度实现敏捷化制造车间生产过程动态调度的方法 ,建立了基于多代理生产组织和运行模式的生产过程动态调度系统框架结构 ,研究了在多代理结构的基础上实现规则调度的方法 ,创建了适应实际生产环境的代理的模型结构 ,并以一类敏捷加工车间动态调度的仿真研究说明所提出方法的思路和可行性。

一种基于神经网络的生产调度方法

提出解决具有开、完工期限制的约束Ｊｏｂ－ｓｈｏｐ生产调度问题的一种神经网络方法．该方法通过约束神经网络，描述各种加工约束条件，并对不满足约束的开工时间进行相应调节，得到可行调度方案；然后由梯度搜索算法优化可行调度方案，直至得到最终优化可行调度解．理论分析、仿真实验表明了方法的有效性。

Two-stage no-wait scheduling models with setup and removal times separated

This paper studies two models of two-stage processing with no-wait in process. The first model is the two-machine flow shop, and the other is the assembly model. For both models we consider the problem of minimizing the makespan, provided that the setup and removal times are separated from the processing times. Each of these scheduling problems is reduced to the Traveling Salesman Problem (TSP). We show that, in general, the assembly problem is NP-hard in the strong sense. On the other hand, the two-machine flow shop problem reduces to the Gilmore-Gomory TSP, and is solvable in polynomial time. The same holds for the assembly problem under some reasonable assumptions. Using these and existing results, we provide a complete complexity classification of the relevant two-stage no-wait scheduling models.

Estado situacional de los algoritmos genéticos en los negocios internacionales

La computación evolutiva y muy especialmente los algoritmos genéticos son cada vez más empleados en las organizaciones para resolver sus problemas de gestión y toma de decisiones (Apoteker & Barthelemy, 2000). La literatura al respecto es creciente y algunos estados del arte han sido publicados. A pesar de esto, no hay un trabajo explícito que evalúe de forma sistemática el uso de los algoritmos genéticos en problemas específicos de los negocios internacionales (ejemplos de ello son la logística internacional, el comercio internacional, el mercadeo internacional, las finanzas internacionales o estrategia internacional). El propósito de este trabajo de grado es, por lo tanto, realizar un estado situacional de las aplicaciones de los algoritmos genéticos en los negocios internacionales.

Estudo do uso de ferramentas cerâmicas na usinagem de inconel 718

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Complessità tecnologica, trasferimento di tecnologia e innovazione

Il presente lavoro ha come obiettivo la definizione e la misura della complessità tecnologica, al fine di costruire strumenti a supporto di tutti gli operatori che si occupano dello sviluppo e della fabbricazione di un prodotto industriale, quali progettisti di prodotto e responsabili di produzione. La ricerca è stata sviluppata attraverso le fasi di seguito descritte. Analisi dello stato dell’arte su definizioni e misure della complessità in ambito industriale attraverso l’individuazione e studio di oltre un centinaio di pubblicazioni al riguardo. Classificazione dei metodi proposti in letteratura per la misura della complessità in cinque categorie e analisi critica dei punti di forza e di debolezza dei differenti metodi, ai fini di orientare la elaborazione di un nuovo metodo. Sono stati inoltre analizzati i principali metodi di Intelligenza Artificiali quali potenziali strumenti di calcolo della complessità. Indagine su tematiche correlate alla complessità quali indicatori, trasferimento tecnologico e innovazione. La complessità viene misurata in termini di un indice che appartiene alla categoria degli indicatori, utilizzati in molti ambiti industriali, in particolare quello della misura delle prestazioni di produzione. In particolare si è approfondito significato e utilizzo dell’OEE (Overall Equipment Effectiveness), particolarmente diffuso nelle piccole medie imprese emilianoromagnole e in generale dalle aziende che utilizzano un sistema produttivo di tipo job-shop. È stato implementato un efficace sistema di calcolo dell’OEE presso una azienda meccanica locale. L’indice di complessità trova una delle sue più interessanti applicazioni nelle operazioni di trasferimento tecnologico. Introdurre un’innovazione significa in genere aumentare la complessità del sistema, quindi i due concetti sono connessi. Sono stati esaminati diversi casi aziendali di trasferimento di tecnologia e di misura delle prestazioni produttive, evidenziando legami e influenza della complessità tecnologica sulle scelte delle imprese. Elaborazione di un nuovo metodo di calcolo di un indice di complessità tecnologica di prodotto, a partire dalla metodologia ibrida basata su modello entropico proposta dai Prof. ElMaraghy e Urbanic nel 2003. L’attenzione è stata focalizzata sulla sostituzione nella formula originale a valori determinati tramite interviste agli operatori e pertanto soggettivi, valori oggettivi. Verifica sperimentale della validità della nuova metodologia attraverso l’applicazione della formula ad alcuni componenti meccanici grazie alla collaborazione di un’azienda meccanica manifatturiera. Considerazioni e conclusioni sui risultati ottenuti, sulla metodologia proposta e sulle applicazioni del nuovo indice, delineando gli obiettivi del proseguo della ricerca. In tutto il lavoro si sono evidenziate connessioni e convergenze delle diverse fonti e individuati in diversi ambiti concetti e teorie che forniscono importanti spunti e considerazioni sul tema della complessità. Particolare attenzione è stata dedicata all’intera bibliografia dei Prof. ElMaraghy al momento riconosciuti a livello internazionale come i più autorevoli studiosi del tema della complessità in ambito industriale.

Knowledge workers and their relationships with organisations

The programme of research examines knowledge workers, their relationships with organisations, and perceptions of management practices through the development of a theoretical model and knowledge worker archetypes. Knowledge worker and non-knowledge worker archetypes were established through an analysis of the extant literature. After an exploratory study of knowledge workers in a small software development company the archetypes were refined to include occupational classification data and the findings from Study 1. The Knowledge Worker Characteristics Model (KWCM) was developed as a theoretical framework in order to analyse differences between the two archetypes within the IT sector. The KWCM comprises of the variables within the job characteristics model, creativity, goal orientation, identification and commitment. In Study 2, a global web based survey was conducted. There were insufficient non-knowledge worker responses and therefore a cluster analysis was conducted to interrogate the archetypes further. This demonstrated, unexpectedly, that that there were marked differences within the knowledge worker archetypes suggesting the need to granulate the archetype further. The theoretical framework and the archetypes were revised (as programmers and web developers) and the research study was refocused to examine occupational differences within knowledge work. Findings from Study 2 identified that there were significant differences between the archetypes in relation to the KWCM. 19 semi-structured interviews were conducted in Study 3 in order to deepen the analysis using qualitative data and to examine perceptions of people management practices. The findings from both studies demonstrate that there were significant differences between the two groups but also that job challenge, problem solving, intrinsic reward and team identification were of importance to both groups of knowledge workers. This thesis presents an examination of knowledge workers’ perceptions of work, organisations and people management practices in the granulation and differentiation of occupational archetypes.

Metodologias de planeamento e gestão da produção na indústria metalúrgica

O presente trabalho propõe demonstrar como o sistema PHC Manufactor se adequa à empresa em estudo, Ciclo Fapril, apresentando as opções de planeamento que este oferece, as dificuldades com que a empresa se irá deparar e, quando possível, o que fazer para ultrapassar as adversidades colocadas pelo sistema. Numa segunda parte são estudadas algumas heurísticas, nomeadamente FIFO, Tempo de Processamento, EDD, MOR e LOR, para se perceber qual a que melhor se adapta à empresa, de forma a poder cumprir com os prazos acordados. Posteriormente utilizou-se a heurística com melhores resultados e fez-se algumas alterações aos tempos de processamento dos centros de trabalho para melhorar a sua capacidade de resposta aos pedidos. No Final deste estudo percebeuse que o planeamento por EDD era o que melhor se adaptava a empresa. Percebeu-se ainda que os centros de trabalho AS e AT são os que têm menor produtividade e por este motivo se deveria aumentar a sua produtividade, de forma a aumentar a produtividade global.

Challenges and Opportunities in Transforming Laser System Industry to Deliver Integrated Product and Service Offers

Part 4: Transition Towards Product-Service Systems

Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion

In the paper, the flow-shop scheduling problem with parallel machines at each stage (machine center) is studied. For each job its release and due date as well as a processing time for its each operation are given. The scheduling criterion consists of three parts: the total weighted earliness, the total weighted tardiness and the total weighted waiting time. The criterion takes into account the costs of storing semi-manufactured products in the course of production and ready-made products as well as penalties for not meeting the deadlines stated in the conditions of the contract with customer. To solve the problem, three constructive algorithms and three metaheuristics (based one Tabu Search and Simulated Annealing techniques) are developed and experimentally analyzed. All the proposed algorithms operate on the notion of so-called operation processing order, i.e. the order of operations on each machine. We show that the problem of schedule construction on the base of a given operation processing order can be reduced to the linear programming task. We also propose some approximation algorithm for schedule construction and show the conditions of its optimality.

Group technology approach to the open shop scheduling problem with batch setup times

This paper studies the problem of scheduling jobs in a two-machine open shop to minimize the makespan. Jobs are grouped into batches and are processed without preemption. A batch setup time on each machine is required before the first job is processed, and when a machine switches from processing a job in some batch to a job of another batch. For this NP-hard problem, we propose a linear-time heuristic algorithm that creates a group technology schedule, in which no batch is split into sub-batches. We demonstrate that our heuristic is a -approximation algorithm. Moreover, we show that no group technology algorithm can guarantee a worst-case performance ratio less than 5/4.

An improved approximation algorithm for the two-machine open shop scheduling problem with family setup times

We consider the problem of scheduling families of jobs in a two-machine open shop so as to minimize the makespan. The jobs of each family can be partitioned into batches and a family setup time on each machine is required before the first job is processed, and when a machine switches from processing a job of some family to a job of another family. For this NP-hard problem the literature contains (5/4)-approximation algorithms that cannot be improved on using the class of group technology algorithms in which each family is kept as a single batch. We demonstrate that there is no advantage in splitting a family more than once. We present an algorithm that splits one family at most once on a machine and delivers a worst-case performance ratio of 6/5.

Realization of an Optimal Schedule for the Two-machine Flow-Shop with Interval Job Processing Times

Non-preemptive two-machine flow-shop scheduling problem with uncertain processing times of n jobs is studied. In an uncertain version of a scheduling problem, there may not exist a unique schedule that remains optimal for all possible realizations of the job processing times. We find necessary and sufficient conditions (Theorem 1) when there exists a dominant permutation that is optimal for all possible realizations of the job processing times. Our computational studies show the percentage of the problems solvable under these conditions for the cases of randomly generated instances with n ≤ 100 . We also show how to use additional information about the processing times of the completed jobs during optimal realization of a schedule (Theorems 2 – 4). Computational studies for randomly generated instances with n ≤ 50 show the percentage of the two- machine flow-shop scheduling problems solvable under the sufficient conditions given in Theorems 2 – 4.

Everyone's problem but nobody's job : staff perceptions and explanations for poor nutritional intake in older medical patients

Aim: Up to 60% of older medical patients are malnourished with further decline during hospital stay. There is limited evidence for effective nutrition intervention. Staff focus groups were conducted to improve understanding of potential contextual and cultural barriers to feeding older adults in hospital. Methods: Three focus groups involved 22 staff working on the acute medical wards of a large tertiary teaching hospital. Staff disciplines were nursing, dietetics, speech pathology, occupational therapy, physiotherapy, pharmacy. A semistructured topic guide was used by the same facilitator to prompt discussions on hospital nutrition care including barriers. Focus groups were tape-recorded, transcribed and analysed thematically. Results: All staff recognised malnutrition to be an important problem in older patients during hospital stay and identified patient-level barriers to nutrition care such as non-compliance to feeding plans and hospital-level barriers including nursing staff shortages. Differences between disciplines revealed a lack of a coordinated approach, including poor knowledge of nutrition care processes, poor interdisciplinary communication, and a lack of a sense of shared responsibility/coordinated approach to nutrition care. All staff talked about competing activities at meal times and felt disempowered to prioritise nutrition in the acute medical setting. Staff agreed education and ‘extra hands’ would address most barriers but did not consider organisational change. Conclusions: Redesigning the model of care to reprioritise meal-time activities and redefine multidisciplinary roles and responsibilities would support coordinated nutrition care. However, effectiveness may also depend on hospitalwide leadership and support to empower staff and increase accountability within a team-led approach.