Single machine scheduling and due date assignment with positionally dependent processing times

We consider single machine scheduling and due date assignment problems in which the processing time of a job depends on its position in a processing sequence. The objective functions include the cost of changing the due dates, the total cost of discarded jobs that cannot be completed by their due dates and, possibly, the total earliness of the scheduled jobs. We present polynomial-time dynamic programming algorithms in the case of two popular due date assignment methods: CON and SLK. The considered problems are related to mathematical models of cooperation between the manufacturer and the customer in supply chain scheduling.

Spank performance tour [at Signals 07 arts festival]

Spank follows the journeys of two women as they reveal stories from private and public sources set apart by two centuries. It investigates notions of 'faction' and what is filtered out historically within a theme of female trauma and the body. [ABSTRACT BY THE AUTHOR]