A taxonomy for the flexible job shop scheduling problem

This chapter aims at developing a taxonomic framework to classify the studies on the flexible job shop scheduling problem (FJSP). The FJSP is a generalization of the classical job shop scheduling problem (JSP), which is one of the oldest NP-hard problems. Although various solution methodologies have been developed to obtain good solutions in reasonable time for FSJPs with different objective functions and constraints, no study which systematically reviews the FJSP literature has been encountered. In the proposed taxonomy, the type of study, type of problem, objective, methodology, data characteristics, and benchmarking are the main categories. In order to verify the proposed taxonomy, a variety of papers from the literature are classified. Using this classification, several inferences are drawn and gaps in the FJSP literature are specified. With the proposed taxonomy, the aim is to develop a framework for a broad view of the FJSP literature and construct a basis for future studies.

Project scheduling and cost minimization with multiple availability constrained resources under stochastic conditions

The authors propose a mathematical model to minimize the project total cost where there are multiple resources constrained by maximum availability. They assume the resources as renewable and the activities can use any subset of resources requiring any quantity from a limited real interval. The stochastic nature is inferred by means of a stochastic work content defined per resource within an activity and following a known distribution and the total cost is the sum of the resource allocation cost with the tardiness cost or earliness bonus in case the project finishes after or before the due date, respectively. The model was computationally implemented relying upon an interchange of two global optimization metaheuristics – the electromagnetism-like mechanism and the evolutionary strategies. Two experiments were conducted testing the implementation to projects with single and multiple resources, and with or without maximum availability constraints. The set of collected results shows good behavior in general and provide a tool to further assist project manager decision making in the planning phase.

Non emergency patients transport - a mixed integer linear programming

This work presents a model and a heuristic to solve the non-emergency patients transport (NEPT) service issues given the new rules recently established in Portugal. The model follows the same principle of the Team Orienteering Problem by selecting the patients to be included in the routes attending the maximum reduction in costs when compared with individual transportation. This model establishes the best sets of patients to be transported together. The model was implemented in AMPL and a compact formulation was solved using NEOS Server. A heuristic procedure based on iteratively solving problems with one vehicle was presented, and this heuristic provides good results in terms of accuracy and computation time.

Otimização com restrições de complementaridade: algoritmos e aplicações

Tese de Doutoramento em Engenharia Industrial e de Sistemas (PDEIS)

Da modelação matemática à simulação computacional: a experimentação matemática no ensino

Tese de Doutoramento em Ciências (área de especialização em Matemática).

Da modelação matemática à simulação computacional: a experimentação matemática no ensino

Tese de Doutoramento em Ciências (área de especialização em Matemática).

Logic programming and artificial neural networks in breast cancer detection

About 90% of breast cancers do not cause or are capable of producing death if detected at an early stage and treated properly. Indeed, it is still not known a specific cause for the illness. It may be not only a beginning, but also a set of associations that will determine the onset of the disease. Undeniably, there are some factors that seem to be associated with the boosted risk of the malady. Pondering the present study, different breast cancer risk assessment models where considered. It is our intention to develop a hybrid decision support system under a formal framework based on Logic Programming for knowledge representation and reasoning, complemented with an approach to computing centered on Artificial Neural Networks, to evaluate the risk of developing breast cancer and the respective Degree-of-Confidence that one has on such a happening.

Cohesion policy in the European Union: a brief critical review

Over the past four decades the EU cohesion policy’s focus, objectives and content have experienced significant changes as a result of successive reforms aiming at adapting it to a Union in constant evolution. In the early stages, cohesion policy had eminently redistributive goals and it assumed an explicit spatial dimension. In the late nineties, the possibility of an extension towards Eastern European countries and the limited willingness of net contributors to increase funding led to a turning point in cohesion policy. The increased importance of economic growth and job creation in the 2000’s, within the cohesion policy’s context, has led to a misrepresentation of its essence and motivations. Cohesion was losing importance towards competitiveness and regional equity towards national efficiency. Today, cohesion policy is for many EU countries the main mean for mobilising investment in a context of budgetary constraints and credit rationing. In light of the available evidence, it is likely that the overall design and priorities of the current cohesion policy have a limited impact in terms of convergence in many EU regions, especially in the less developed regions. This paper’s main objectives are to analyse the evolution of European cohesion policy throughout its history, to present a picture of cohesion policy in the 2014-2020 programming period and to discuss the main problems associated with its design, priorities and programming model.

Automatização e otimização do escalonamento de pessoal hospitalar

Dissertação de mestrado em Engenharia de Sistemas

Single line for assembly just-in-sequence multiple models

Programa Doutoral em Líderes para as Indústrias Tecnológicas

Towards the design and implementation of aspect-oriented programming for spreadsheets

A spreadsheet usually starts as a simple and singleuser software artifact, but, as frequent as in other software systems, quickly evolves into a complex system developed by many actors. Often, different users work on different aspects of the same spreadsheet: while a secretary may be only involved in adding plain data to the spreadsheet, an accountant may define new business rules, while an engineer may need to adapt the spreadsheet content so it can be used by other software systems.Unfortunately,spreadsheetsystemsdonotoffermodular mechanisms, and as a consequence, some of the previous tasks may be defined by adding intrusive “code” to the spreadsheet. In this paper we go through the design and implementation of an aspect-oriented language for spreadsheets so that users can work on different aspects of a spreadsheet in a modular way. For example, aspects can be defined in order to introduce new business rules to an existing spreadsheet, or to manipulate the spreadsheet data to be ported to another system. Aspects are defined as aspect-oriented program specifications that are dynamically woven into the underlying spreadsheet by an aspect weaver. In this aspect-oriented style of spreadsheet development, differentusers develop,orreuse,aspects withoutaddingintrusive code to the original spreadsheet. Such code is added/executed by the spreadsheet weaving mechanism proposed in this paper.

Metaphorisms in programming

This paper introduces the metaphorism pattern of relational specification and addresses how specification following this pattern can be refined into recursive programs. Metaphorisms express input-output relationships which preserve relevant information while at the same time some intended optimization takes place. Text processing, sorting, representation changers, etc., are examples of metaphorisms. The kind of metaphorism refinement proposed in this paper is a strategy known as change of virtual data structure. It gives sufficient conditions for such implementations to be calculated using relation algebra and illustrates the strategy with the derivation of quicksort as example.

Employment, turnover and career progress

The severe economic downturn that followed the Global Financial Crisis of 2007 was accompanied by major fluctuations in the labour market. During the Great Recession the rate of job destruction was such that, by 2013, active population was at levels of 1999; employment levels were at an historical minimum; and the unemployment rate soared to 17,5%. This chapter inspects the dynamics behind the aggregate fl uctuations in the labour market and studies the determinants of mobility within (promotions) and between fi rms, and whether these have changed during crisis, using Portuguese (LEED) data. During crisis women became more likely to make between- rm moves with short gaps of unemployment and less likely to find a new job after a long gap or to make a job-to-non-employment transition. More educated workers are less likely to experience between fi rm job mobility, both before and during crisis, and became less likely to make job-to-non-employment transitions during crisis. Young workers are the group that most suffered from crisis: they became less likely to make job-to-job transitions and their hazard of experiencing a transition into unemployment shoot up.