Single-machine scheduling with supporting tasks

This paper investigates a single-machine scheduling problem with a set of supporting tasks and a set of jobs. Each job is preceded by a subset of supporting tasks, that is, the job cannot start its processing until all of its supporting tasks are finished. The objective functions are defined solely in job completion times. We discuss the complexities of several special cases for the number of late jobs and the total weighted completion time. This study adds new complexity results to the two standard objective functions under precedence constraints.

[1]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

[2]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[3]  Jan Karel Lenstra,et al.  Complexity results for scheduling chains on a single machine : (preprint) , 1980 .

[4]  D. Adolphson.  Optimal linear-ordering. , 1973 .

[5]  Vitaly A. Strusevich,et al.  The open shop scheduling problem with a given sequence of jobs on one machine , 1998 .

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  E. Lawler.  Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

[8]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[9]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[10]  Refael Hassin,et al.  An Approximation Algorithm for the Minimum Latency Set Cover Problem , 2005, ESA.

[11]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[12]  F. J. Hwang,et al.  Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence , 2014, Ann. Oper. Res..

[13]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[14]  Paolo Toth,et al.  Linear Assignment Problems , 1987 .

[15]  Jan Karel Lenstra,et al.  Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..

[16]  W. A. Horn.  Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties , 1972 .