In this paper preparation sequencing situations are introduced. This new type of one-machine sequencing situations assumes that before a job can start, some preparation depending on its predecessor is required. Preparation sequencing situations are first analyzed from an operations research...

This paper studies sequencing situations with non-linear cost functions. We show that the neighbor switching gains are now time-dependent, in contrast to the standard sequencing situations with linear cost functions, which complicate finding an optimal order and stable allocations. We derive...