It Takes Two to Tango: Entrepreneurship and Creativity in Troubled Times – Vietnam 2012

Strikingly, most literature suggests that market competition will push firms to take creativity/innovation seriously as matter of death or survival. Using the data, we examined creativity methods (Napier and Nilsson, 2008; Napier, 2010) in conjunction with three influential cultural values – namely risk tolerance, relationship, and dependence on resources – to assess how they influence decisions of entrepreneurs.The primary objective of this study focuses on perceived values of entrepreneurship and creativity in business conducted within a turbulent environment. Our initial hypothesis is that a typical entrepreneurial process carries with it “creativity-enabling elements.” In a normal situation, when businesses focus more on optimizing their resources for commercial gains, perceptions about values of entrepreneurial creativity are usually vague. However, in difficult times and harsh competition, the difference between survival and failure may be creativity. This paper also examines many previous findings on both entrepreneurship and creativity and suggests a highly possible “organic growth” of creativity in an entrepreneurial environment and reinforcing value of entrepreneurship when creativity power is present. In other words, we see each idea reinforcing the other. We use data from a survey of sample Vietnamese firms during the chaotic economic year 2012 to learn about the ‘entrepreneurshipcreativity nexus.’ A data set of 137 responses qualified for a statistical examination was obtained from an online survey, which started on February 16 and ended May 24, 2012, sent to local entrepreneurs and corporate managers using social networks. The authors employed categorical data analysis (Agresti, 2002; Azen & Walker, 2011). Statistical analyses confirm that for business operation, the creativity and entrepreneurial spirit could hardly be separate; and, this is not only correct with entrepreneurial firm, but also well established companies. The single most important factor before business startup and during early implementation in Vietnam is what we call “connection/relationship.” However, businesspeople are increasingly aware of the need of creativity/innovation. In fact, we suggest that creativity and entrepreneurial spirit cannot be separated in entrepreneurial firms as well as established companies.

Analysis of soil carbon transit times and age distributions using network theories

The long-term soil carbon dynamics may be approximated by networks of linear compartments, permitting theoretical analysis of transit time (i.e., the total time spent by a molecule in the system) and age (the time elapsed since the molecule entered the system) distributions. We compute and compare these distributions for different network. configurations, ranging from the simple individual compartment, to series and parallel linear compartments, feedback systems, and models assuming a continuous distribution of decay constants. We also derive the transit time and age distributions of some complex, widely used soil carbon models (the compartmental models CENTURY and Rothamsted, and the continuous-quality Q-Model), and discuss them in the context of long-term carbon sequestration in soils. We show how complex models including feedback loops and slow compartments have distributions with heavier tails than simpler models. Power law tails emerge when using continuous-quality models, indicating long retention times for an important fraction of soil carbon. The responsiveness of the soil system to changes in decay constants due to altered climatic conditions or plant species composition is found to be stronger when all compartments respond equally to the environmental change, and when the slower compartments are more sensitive than the faster ones or lose more carbon through microbial respiration. Copyright 2009 by the American Geophysical Union.

Interior pathways of the North Atlantic meridional overturning circulation.

To understand how our global climate will change in response to natural and anthropogenic forcing, it is essential to determine how quickly and by what pathways climate change signals are transported throughout the global ocean, a vast reservoir for heat and carbon dioxide. Labrador Sea Water (LSW), formed by open ocean convection in the subpolar North Atlantic, is a particularly sensitive indicator of climate change on interannual to decadal timescales. Hydrographic observations made anywhere along the western boundary of the North Atlantic reveal a core of LSW at intermediate depths advected southward within the Deep Western Boundary Current (DWBC). These observations have led to the widely held view that the DWBC is the dominant pathway for the export of LSW from its formation site in the northern North Atlantic towards the Equator. Here we show that most of the recently ventilated LSW entering the subtropics follows interior, not DWBC, pathways. The interior pathways are revealed by trajectories of subsurface RAFOS floats released during the period 2003-2005 that recorded once-daily temperature, pressure and acoustically determined position for two years, and by model-simulated 'e-floats' released in the subpolar DWBC. The evidence points to a few specific locations around the Grand Banks where LSW is most often injected into the interior. These results have implications for deep ocean ventilation and suggest that the interior subtropical gyre should not be ignored when considering the Atlantic meridional overturning circulation.

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.

Approximation algorithms for two-machine flow shop scheduling with batch setup times

In many practical situations, batching of similar jobs to avoid setups is performed while constructing a schedule. This paper addresses the problem of non-preemptively scheduling independent jobs in a two-machine flow shop with the objective of minimizing the makespan. Jobs are grouped into batches. A sequence independent 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. Besides its practical interest, this problem is a direct generalization of the classical two-machine flow shop problem with no grouping of jobs, which can be solved optimally by Johnson's well-known algorithm. The problem under investigation is known to be NP-hard. We propose two O(n logn) time heuristic algorithms. The first heuristic, which creates a schedule with minimum total setup time by forcing all jobs in the same batch to be sequenced in adjacent positions, has a worst-case performance ratio of 3/2. By allowing each batch to be split into at most two sub-batches, a second heuristic is developed which has an improved worst-case performance ratio of 4/3. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

A 3/2 algorithm for two-machine open shop with route-dependent processing times

This paper considers the problem of minimizing the schedule length of a two-machine shop in which not only can a job be assigned any of the two possible routes, but also the processing times depend on the chosen route. This problem is known to be NP-hard. We describe a simple approximation algorithm that guarantees a worst-case performance ratio of 2. We also present some modifications to this algorithm that improve its performance and guarantee a worst-case performance ratio of 3=2.

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.

Two-machine open shop scheduling with special transportation times

The paper considers a problem of scheduling n jobs in a two-machine open shop to minimise the makespan, provided that preemption is not allowed and the interstage transportation times are involved. In general, this problem is known to be NP-hard. We present a linear time algorithm that finds an optimal schedule if no transportation time exceeds the smallest of the processing times. We also describe an algorithm that creates a heuristic solution to the problem with job-independent transportation times. Our algorithm provides a worst-case performance ratio of 8/5 if the transportation time of a job depends on the assigned processing route. The ratio reduces to 3/2 if all transportation times are equal.

A heuristic for the two-machine open-shop scheduling problem with transportation times

The paper considers a problem of scheduling n jobs in a two-machine open shop to minimize the makespan, provided that preemption is not allowed and the interstage transportation times are involved. This problem is known to be unary NP-hard. We present an algorithm that requires O (n log n) time and provides a worst-case performance ratio of 3/2.

Proportionate flow shop with controllable processing times

This paper considers a special class of flow-shop problems, known as the proportionate flow shop. In such a shop, each job flows through the machines in the same order and has equal processing times on the machines. The processing times of different jobs may be different. It is assumed that all operations of a job may be compressed by the same amount which will incur an additional cost. The objective is to minimize the makespan of the schedule together with a compression cost function which is non-decreasing with respect to the amount of compression. For a bicriterion problem of minimizing the makespan and a linear cost function, an O(n log n) algorithm is developed to construct the Pareto optimal set. For a single criterion problem, an O(n2) algorithm is developed to minimize the sum of the makespan and compression cost. Copyright © 1999 John Wiley & Sons, Ltd.

The collection and analysis of pre-evacuation times derived from evacuation trials and their application to evacuation modelling

This paper presents data relating to occupant pre-evacuation times from university and hospital outpatient facilities. Although the two occupancies are entirely different, they do employ relatively similar procedures: members of staff sweep areas to encourage individuals to evacuate.However the manner in which the dependent population reacts to these procedures is quite different. In the hospital case, the patients only evacuated once a member of the nursing staff had instructed them to do so, while in the university evacuation, the students were less dependent upon the actions of the staff, with over 50% of them evacuating with no prior prompting. In addition, the student pre-evacuation time was found to be dependent on their level of engagement in various activities.

The collection of pre-evacuation times from evacuation trials involving a Hospital Outpatient area and a University Library facility

This paper presents data relating to occupant pre-evacuation times from a university and a hospital outpatient facility. Although the two structures are entirely different they do employ relatively similar procedures: members of staff sweeping areas of the structure to encourage individuals to evacuate. However, the manner in which the dependent population reacts to these procedures is quite different. In the hospital case the patients only evacuated once a member of the nursing staff had instructed them to do so while in the university evacuation the students were less dependent upon the actions of the staff with over 50% of them evacuating with no prior prompting. Although this data may be useful in a variety of areas, it was collected primarily for use within evacuation models.

Simulation of ship evacuation and passenger circulation

This paper describes work carried out in the FIRE EXIT research project. FIRE EXIT aims to develop an Evacuation Simulator, capable of addressing issues of mustering, ship motions, fire and abandonment. In achieving these aims, FIRE EXIT took as its starting point the state-of-the-art in ship evacuation simulation (the maritimeEXODUS software), fire simulation (the SMARTFIRE software) and large-scale experimental facilities (the SHEBA facility). It then significantly enhanced these capabilities. A number of new technologies have been developed in achieving these objectives. The innovations include directly linking CFD fire simulation with evacuation and abandonment software and automatic data transfer from concept design software allowing rapid generation of ship simulation models. Software usability was augmented by a module for interpretation of evacuation software output. Enhancements to a ship evacuation testing rig have resulted in a unique facility, capable of providing passenger movement data for realistic evacuation scenarios and large scale tests have provided meaningful data for the evacuation simulation.