Abstract
One of the most important, applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop 1)011) a mathematical programming formulation and simple metaheuristics for solving it The formulation is based on a transformation of the input, data, in such a way that a standard mathematical programming model for the Asymmetric: Travelling Salesman Problem can be used on this slightly different problem. Two standard metaheuristics for the asymmetric travelling salesman are proposed and analysed on this variant: repeated random construction followed by local search with the 3-Exchange neighbourhood. and iterated local search based on the same neighbourhood and on a 4-Exchange perturbation. The computational results obtained show the interest, and the complementary merits of using a mixed-integer programming solver and an approximative method for the solution of this problem.

Abstract
Designers aspire to create engaging and desirable experiences. To that end they study users, aiming to better understand their preferences, ways of thinking and desired outcomes. In the service sector this task is more intricate as experiences encompass the whole customer journey, or the sequence of moments of interaction between customer and company. In services, one poorly designed interaction can severely compromise the overall experience. Despite experience holistic nature, current methods address its components separately, failing to provide an overall systematized picture. This paper presents Customer Experience Modeling, a novel multidisciplinary approach to systematize, represent and evaluate customer experiences to guide service and interaction design efforts. We illustrate this method with an application to a multimedia service provider built upon 17 interviews with service users.

Abstract
Wafer slicing in photovoltaic industry is mainly done using multi-wire saw machines. The selection of set of bricks (parallelepiped block of crystalline silicon) to be sawn together poses difficult production scheduling decisions. The objective is to maximize the utilization of the available cutting length to improve the process throughput. We address the problem presenting a mathematical formulation and an algorithm that aims to solve it in very short running times while delivering superior solutions. The algorithm employs a reactive greedy randomized adaptive search procedure with some enhancements. Computational experiments proved its effectiveness and efficiency to solve real-world based problems and randomly generated instances. Implementation of an on-line decision system based on this algorithm can help photovoltaic industry to reduce slicing costs making a contribution for its competitiveness against other sources of energy.

Abstract
Hospital performance is a critical issue in society and its assessment must be tactfully studied in order to evaluate future decisions. In this paper we report an operating theatre study based on a simulation model, describing one of the biggest public hospitals in the north of Portugal. The model encompasses several operating rooms shared among different medical services and considers the arrival of both elective and emergency patients. We focus on a critical planning problem of the operating theatre, the allocation of medical services to operating rooms and shifts. With a discrete-event simulation model we assess the performance of the current schedule distribution and perform a set of tests in order to find a better master surgery schedule. Experiments show improvement opportunities by balancing surgical services capacities. © 2011 IEEE.

Abstract
In this paper we present a novel approach to tackling the synchronisation of a secondary resource in lot-sizing and scheduling problems. This kind of problem occurs in various manufacturing processes (e. g. wafer testing in the semiconductor industry, production and bottling of soft drinks). We consider a scenario of parallel unrelated machines that have to be equipped with a tool or need a special kind of resource for processing. Our approach allows tracing the assignment of these secondary resources across different machines and synchronising their usage independently of the time period. We present extensions of the general lot-sizing and scheduling problem and of the capacitated lot-sizing problem. We prove that the latter model is a special case of the first, but it performs computationally much better.

Abstract
The editorial section of International Journal of Production Research provides information about industrial extensions and research opportunities in the fields of lot sizing and scheduling in industries. Some of the papers published in the journal reveal that the processing industry provides significant opportunities for conducting research in these areas. The scheduling of production lots and their sizing is an area of increasing research attention within the wider field of production planning and scheduling. The close relationship between lot sizing and scheduling in many industrial applications makes it essential that these decisions are made simultaneously to use capacity efficiently. Traditional models have been increasingly refined to incorporate more detail and integrate lot sizing with scheduling. Researchers and practitioners worldwide have been making efforts to incorporate more specificities of the production environment in their models besides the integration of several independent self-contained research fields.