The open shop scheduling problem with a given sequence of jobs on one machine

The paper considers the open shop scheduling problem to minimize the make-span, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not allowed, the problem is NP-hard in the strong sense if the number of machines is variable, and is NP-hard in the ordinary sense in the case of two machines. For the latter case we give a heuristic algorithm that runs in linear time and produces a schedule with the makespan that is at most 5/4 times the optimal value. We also show that the two-machine problem in the nonpreemptive case is solvable in pseudopolynomial time by a dynamic programming algorithm, and that the algorithm can be converted into a fully polynomial approximation scheme. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 705–731, 1998

Shop-scheduling problems with fixed and non-fixed machine orders of the jobs

The paper deals with the determination of an optimal schedule for the so-called mixed shop problem when the makespan has to be minimized. In such a problem, some jobs have fixed machine orders (as in the job-shop), while the operations of the other jobs may be processed in arbitrary order (as in the open-shop). We prove binary NP-hardness of the preemptive problem with three machines and three jobs (two jobs have fixed machine orders and one may have an arbitrary machine order). We answer all other remaining open questions on the complexity status of mixed-shop problems with the makespan criterion by presenting different polynomial and pseudopolynomial algorithms.

Two-machine flowshop scheduling problems with no-wait jobs

We study a two-machine flow shop scheduling problem with no-wait in process, in which one of the machines is not available during a specified time interval. We consider three scenarios of handing the operation affected by the nonavailability interval. Its processing may (i) start from scratch after the interval, or (ii) be resumed from the point of interruption, or (iii) be partially restarted after the interval. The objective is to minimize the makespan. We present an approximation algorithm that for all these scenarios delivers a worst-case ratio of 3/2. For the second scenario, we offer a 4/3-approximation algorithm.

Scheduling three-operation jobs in a two-machine flow shop to minimize makespan

This paper considers a variant of the classical problem of minimizing makespan in a two-machine flow shop. In this variant, each job has three operations, where the first operation must be performed on the first machine, the second operation can be performed on either machine but cannot be preempted, and the third operation must be performed on the second machine. The NP-hard nature of the problem motivates the design and analysis of approximation algorithms. It is shown that a schedule in which the operations are sequenced arbitrarily, but without inserted machine idle time, has a worst-case performance ratio of 2. Also, an algorithm that constructs four schedules and selects the best is shown to have a worst-case performance ratio of 3/2. A polynomial time approximation scheme (PTAS) is also presented.

Two-machine flow shop scheduling problems with no-wait jobs

In this paper we provide a fairly complete complexity classification of various versions of the two-machine permutation flow shop scheduling problem to minimize the makespan in which some of the jobs have to be processed with no-wait in process. For some version, we offer a fully polynomial-time approximation scheme and a 43-approximation algorithm.

Transporting jobs through a two-machine open shop

We consider the two-machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find the sequence of moves of the transporter so that the time by which the completed jobs are collected together on board the transporter is minimal. We present a 7/5-approximation algorithm. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009

Modernity, the new republic and Sing Sing: The creation of a disciplined workforce and citizenry

[Author's description] Bringing together new research on punishment and control in the 19th and 20th centuries, this collection begins by examining the development of the modern prison, gender, social control and punishment, and psychiatry and the criminal justice system. Further, it explores penal olicy, prison practice, and discourses on offenders, providing case studies of: the 'respectable' criminal, the female inebriate and the juvenile offender. The final part examines the experiences of confinement, discipline and resistance, through prisoner memoirs, prison riots and resistance and identity in residential institutions.

‘The Pinocchio Effect’ – when managing the brand creation process, across cultures

In global marketing and international management, the fields of Branding and Culture are well discussed as separate disciplines; within both academia and industry. However, there appears to be limited supporting literature, examining brands and culture as a collective discipline. In addition, environmental factors such as ethnicity, nationality and religion are also seen to play a significant role. This in itself adds to the challenges encountered, by those looking to critically apply learning and frameworks, to any information gathered. In the first instance, this paper tries to bring aspects together from Branding and Culture and in doing so, aims to find linkages between the two. The main purpose of this paper is to distil current brand thinking and explore what impact cross-cultural, cross-national, and ethnic interactions have on a brand’s creation. The position of the authors is that without further understanding in this field, a brand will experience what has been termed by them as the ‘Pinocchio Effect’. Pinocchio was a puppet who longed to become a real human being; but sadly encountered difficulties. The conclusion presented is that the critical long-term success of a brand lies in three areas: how it is created; the subsequent associated perceptions; and more specifically in the reality of the relationships that it enjoys. Collectively these processes necessitate an appraisal of connecting strategic management procedures and thinking. Finally, this paper looks into proposing future methods for brand evaluation and strategic management. The aim is to stimulate further thinking in a field; which transcends national, ethnic and cultural boundaries - in the interests of developing new insight, and to provide a platform for marketers to develop more effective communications.

The Olympic Games and urban displacement: the case of Beijing

Urban spectacles such as the Olympic Games have been long perceived as being able to impose desired effects in the city that act as host. This kind of urban boost may include the creation of new jobs and revenue for local community, growth in tourism and convention business, improvements to city infrastructure and environment, and the stimulation of broad reform in the social, political and institutional realm. Nevertheless at the other end of the debate, the potentially detrimental impacts of Olympic urban development, particularly on disadvantaged and vulnerable groups, have also been increasingly noticed in recent years and subsequently cited by a number of high profile anti-Olympic groups to campaign against Olympic bids and awards. The common areas of concern over Olympic-related projects include the cost and debts risk, environmental threat, the occurrence of social imbalance, and disruption and disturbance of existing community life. Among these issues, displacement of low income households and squatter communities resulting from Olympic-inspired urban renewal are comparatively under-explored and have emerged as an imperative area for research inquiry. This is particularly the case where many other problems have become less prominent. Changing a city’s demographic landscape, particularly displacing lower income people from the area proposed for a profitable development is a highly contentious matter in its own right. Some see it as a natural and inevitable outgrowth of the process of urban evolution, without which cities cannot move towards a more attractive location for consumption-based business. Others believe it reflects urban crises and conflicts, highlighting the market failures, polarization and injustice. Regardless of perception,these phenomena are visible everywhere in post-industrial cities and particularly cannot be ignored when planning for the Olympic Games and other mega-events. The aim of this paper is to start the process of placing the displacement issue in the context of Olympic preparation and to seek a better understanding of their interrelations. In order to develop a better understanding of this issue in terms of cause, process, influential factors and its implication on planning policy, this paper studies the topic from both theoretic and empirical angles. It portrays various situations where the Olympics may trigger or facilitate displacement in host cities during the preparation of the Games, identifies several major variables that may affect the process and the overall outcome, and explores what could be learnt in generic terms for planning Olympic oriented infrastructure so that ill-effects to the local community can be effectively controlled. The paper concludes that the selection of development sites, the integration of Olympic facilities with the city’s fabric, the diversity of housing type produced for local residents and the dynamics of the new socioeconomic structure.