An Investigation of Phase Transitions in Single-Machine Scheduling Problems

We investigate solvable-unsolvable phase transitions in the single-machine scheduling (SMS) problem. SMS is at the core of practical problems such as telescope and satellite scheduling and manufacturing. To study the solvability phase transition, we construct a variety of instance families parameterized by the set of the processing times, the window size (deadline minus release time), and the horizon. We empirically establish the phase transition and look for an easy-hardeasy pattern for this family using several common solvers. While in many combinatorial problems a phase transition coincides with typically hard instances, whether or not that is the case with SMS remains an open question, and merits fur-

[1]  Tad Hogg,et al.  The Hardest Constraint Problems: A Double Phase Transition , 1994, Artif. Intell..

[2]  Christian Borgs,et al.  Phase transition and finite‐size scaling for the integer partitioning problem , 2001, Random Struct. Algorithms.

[3]  Toby Walsh,et al.  The TSP Phase Transition , 1996, Artif. Intell..

[4]  Martin E. Dyer,et al.  Locating the Phase Transition in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..

[5]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[6]  Christoph Dürr,et al.  Finding Total Unimodularity in Optimization Problems Solved by Linear Programs , 2006, ESA.

[7]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[8]  Patrick Prosser,et al.  An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..

[9]  Jirí Sgall.  Open Problems in Throughput Scheduling , 2012, ESA.

[10]  Cristopher Moore,et al.  A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas , 2005, APPROX-RANDOM.

[11]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[12]  Andreas Goerdt,et al.  A Threshold for Unsatisfiability , 1992, MFCS.

[13]  Robert E. Tarjan,et al.  Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines , 1981, SIAM J. Comput..

[14]  Nadia Creignou,et al.  Satisfiability Threshold for Random XOR-CNF Formulas , 1999, Discret. Appl. Math..

[15]  S. Mertens.  Phase Transition in the Number Partitioning Problem , 1998, cond-mat/9807077.

[16]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[17]  Toby Walsh,et al.  Phase Transitions and Annealed Theories: Number Partitioning as a Case Study , 1996, ECAI.

[18]  Barbara B. Simons,et al.  A fast algorithm for single processor scheduling , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[19]  D. Achlioptas,et al.  A sharp threshold for k-colorability , 1999 .

[20]  Bruce A. Reed,et al.  Mick gets some (the odds are on his side) (satisfiability) , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[21]  Thomas Stützle,et al.  SATLIB: An Online Resource for Research on SAT , 2000 .

[22]  Mathijs de Weerdt,et al.  Scheduling with two non-unit task lengths is NP-complete , 2014, ArXiv.

[23]  Jeremy Frank,et al.  Parametrized Families of Hard Planning Problems from Phase Transitions , 2014, AAAI.

[24]  S Kirkpatrick,et al.  Critical Behavior in the Satisfiability of Random Boolean Expressions , 1994, Science.

[25]  Toby Walsh,et al.  The Hardest Random SAT Problems , 1994, KI.

[26]  J. Culberson,et al.  The Gn,m Phase Transition is Not Hard for the Hamiltonian Cycle Problem , 1998, J. Artif. Intell. Res..

[27]  John N. Hooker,et al.  Branch-and-cut solution of inference problems in propositional logic , 2005, Annals of Mathematics and Artificial Intelligence.