|Publication type:||Conference other|
|Type of review:||Editorial review|
|Title:||Scheduling with time-dependent processing time functions of V-shaped linear pieces|
|Conference details:||18th Swiss Operations Research Days (Swiss OR Days 2022), Winterthur, Switzerland, 2-3 June 2022|
|Subjects:||Single-machine scheduling; Time-dependent scheduling; Non-monotonic processing time; Piecewise-linear processing time; V-shaped processing time|
|Subject (DDC):||658.5: Production management|
|Abstract:||Scheduling is classically centered around jobs with constant processing times. This allows for universal methods of a simple structure, like Smith’s rule, proven by job interchange arguments. Certain applications, however, entail variable processing times, depending on the job’s start time. Then, interchanging jobs implies changing start times for successive jobs, which escalates the computational complexity. To plan car assembly on a moving conveyor line, we are concerned with time-dependent processing time functions that are V-shaped and piecewise-linear. We present complexity results and draw relations to classic scheduling problems.|
|Fulltext version:||Published version|
|License (according to publishing contract):||Not specified|
|Departement:||School of Engineering|
|Organisational Unit:||Institute of Data Analysis and Process Design (IDP)|
|Appears in collections:||Publikationen School of Engineering|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.