Decision diagram-based integer programming for the paired job scheduling problem

The paired job scheduling problem seeks to schedule n jobs on a single machine, each job consisting of two tasks for which there is a mandatory minimum waiting time between the completion of the fi...

[1]  Ceyda Oguz,et al.  Scheduling chains with identical jobs and constant delays on a single machine , 2006, Math. Methods Oper. Res..

[2]  Masaaki Nagata,et al.  BDD-Constrained Search: A Unified Approach to Constrained Shortest Path Problems , 2015, AAAI.

[3]  Carla Michini,et al.  Compact representations of all members of an independence system , 2016, Annals of Mathematics and Artificial Intelligence.

[4]  David Bergman,et al.  Theoretical insights and algorithmic tools for decision diagram-based optimization , 2016, Constraints.

[5]  Friedrich Eisenbrand,et al.  0/1 Vertex and Facet Enumeration with BDDs , 2007, ALENEX.

[6]  Peter Brucker,et al.  Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags , 2014, Computing.

[7]  Bernd Becker,et al.  BDDs in a Branch and Cut Framework , 2005, WEA.

[8]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[9]  David Bergman,et al.  Multiobjective Optimization by Decision Diagrams , 2016, CP.

[10]  George L. Nemhauser,et al.  One-machine generalized precedence constrained scheduling problems , 1994, Oper. Res. Lett..

[11]  J. Christopher Beck.  Principles and Practice of Constraint Programming , 2017, Lecture Notes in Computer Science.

[12]  David Bergman,et al.  Discrete Nonlinear Optimization by State-Space Decompositions , 2017, Manag. Sci..

[13]  Ronald L. Rardin,et al.  Polyhedral Characterization of Discrete Dynamic Programming , 1990, Oper. Res..

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

[15]  Jatinder N. D. Gupta.  Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags , 1996, J. Glob. Optim..

[16]  David Bergman,et al.  Manipulating MDD Relaxations for Combinatorial Optimization , 2011, CPAIOR.

[17]  David Bergman,et al.  Decision Diagram Decomposition for Quadratically Constrained Binary Optimization , 2020, INFORMS J. Comput..

[18]  George G. Polak,et al.  Minimizing flowtime for paired tasks , 2017, Eur. J. Oper. Res..

[19]  Leonardo Lozano,et al.  A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs , 2018, Math. Program..

[20]  George G. Polak,et al.  Scheduling parallel assembly workstations to minimize a shared pool of labor , 2008 .

[21]  Dan Suciu,et al.  Oblivious bounds on the probability of boolean functions , 2014, ACM Trans. Database Syst..

[22]  Jean-Charles Régin,et al.  Constructions and In-Place Operations for MDDs Based Constraints , 2016, CPAIOR.

[23]  Peter Brucker,et al.  A Branch and Bound Algorithm for a Single-machine Scheduling Problem with Positive, Negative Time-lags , 1999, Discret. Appl. Math..

[24]  Han Hoogeveen,et al.  Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard , 2004, J. Sched..

[25]  Francis Sourd,et al.  Scheduling chains on a single machine with non-negative time lags , 2003, Math. Methods Oper. Res..

[26]  Markus Behle,et al.  Binary decision diagrams and integer programming , 2007 .

[27]  A. J. Orman,et al.  On the Complexity of Coupled-task Scheduling , 1997, Discret. Appl. Math..

[28]  Martin W. P. Savelsbergh,et al.  Time-Indexed Formulations for Machine Scheduling Problems: Column Generation , 2000, INFORMS J. Comput..

[29]  David Bergman,et al.  On the Consistent Path Problem , 2020, Oper. Res..

[30]  Martin E. Dyer,et al.  Formulating the single machine sequencing problem with release dates as a mixed integer program , 1990, Discret. Appl. Math..

[31]  Jean-Charles Régin,et al.  Relations between MDDs and Tuples and Dynamic Modifications of MDDs based constraints , 2015, ArXiv.

[32]  David Bergman,et al.  Discrete Optimization with Decision Diagrams , 2016, INFORMS J. Comput..

[33]  David Bergman,et al.  Optimization Bounds from Binary Decision Diagrams , 2014, INFORMS J. Comput..

[34]  Roy D. Shapiro,et al.  Scheduling coupled tasks , 1980 .

[35]  André Augusto Ciré,et al.  Multivalued Decision Diagrams for Sequencing Problems , 2013, Oper. Res..

[36]  Willem Jan van Hoeve,et al.  A Systematic Approach to MDD-Based Constraint Programming , 2010, CP.

[37]  John N. Hooker,et al.  Cost-Bounded Binary Decision Diagrams for 0-1 Programming , 2007, CPAIOR.