The politics of 'dirt' in "Dirty Jobs"

Commercial television, particularly when associated with cable networks and global distribution, is often criticised for presenting us with a sanitised view of the world. This is particularly true when it comes to American programs which are targeted for their cliché Hollywood happy endings, idyllic families who lead overly materialistic lifestyles. This political denigration of TV is a complaint about how programs offer us an escape from the harsher, dirtier realities of life. But if we take the metaphor of dirt more seriously, it’s possible to find some interesting political meanings attached to its use on cable television. Dirty Jobs with Mike Rowe is a reality-documentary style program about dirty, hazardous, strange or unconventional jobs. It uses the concept of dirt to address some significant taboos about class within America television culture.

ACE research vignette 006 : why saving jobs and supporting failing firms can be detrimental

This series of research vignettes is aimed at sharing current and interesting research findings from our team and other international Entrepreneurship researchers. In this vignette, we summarise the findings from a paper written by Avaid Pe'er and Ilan Vertinsky that examines "Why saving jobs and supporting failing firms can be detrimental".

Jobs for creatives outside the creative industries: A study of creatives working in the Australian manufacturing industry

More creatives work outside the creative industries than inside them. Recent Australian Census data show that 52 per cent of creatives work outside of the core creative industries. These embedded creatives make up 2 per cent of manufacturing industry employees. There is little qualitative research into embedded creatives. This paper aims to address this by exploring the contribution of creative skills to manufacturing in Australia. Through four case studies of designers and marketing staff in lighting and car seat manufacturing companies, this paper demonstrates some of the work that embedded creatives undertake in the manufacturing industry and some of the ways that they contribute to innovation. The paper also considers perspectives embedded creatives bring to manufacturing and challenges involved in being a creative worker in a non-creative industry. This research is important to economic development issues, demonstrating some of the roles of key innovators in an important industry. This work also informs the education of creative industries students who will go on to contribute in a variety of industries. Furthermore, this research exemplifies one industry where employment is available to creatives outside of the creative industries.

Creative destruction: The Trans-Pacific Partnership, jobs, and labor rights

In the United States, there has been a fierce debate over the Trans-Pacific Partnership (TPP), and its impact upon jobs, employment, and labor rights and standards. This sweeping trade agreement spans the Pacific Rim, and includes such countries as Australia, New Zealand, Canada, Mexico, Peru, Chile, Malaysia, Singapore, Vietnam, Brunei, and Japan. There has been concern over the secrecy surrounding the Trans-Pacific Partnership — particularly in respect of labor rights.

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