Scheduling two chains of unit jobs on one machine: A polyhedral study

We investigate polyhedral properties of the following scheduling problem: given two sets of unit, indivisible jobs and revenue functions of the jobs completion times, find a one-machine schedule maximizing the total revenue under the constraint that the schedule of each job set respects a prescribed chain-like precedence relation. A solution to this problem is an order preserving assignment of the jobs to a set of time-slots. We study the convex hull of the feasible assignments and provide families of facet-defining inequalities in two cases: (i) each job must be assigned to a time-slot and (ii) a job does not need to be assigned to any time-slot. © 2011 Wiley Periodicals, Inc. NETWORKS, 2011 © 2011 Wiley Periodicals, Inc.

[1]  Laurence A. Wolsey,et al.  Lot-Sizing with Constant Batches: Formulation and Valid Inequalities , 1993, Math. Oper. Res..

[2]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[3]  Martin W. P. Savelsbergh,et al.  The relation of time indexed formulations of single machine scheduling problems to the node packing problem , 2002, Math. Program..

[4]  Annegret Wagler,et al.  On facets of stable set polytopes of claw-free graphs with stability number 3 , 2010, Discret. Math..

[5]  Frits C. R. Spieksma,et al.  Scheduling jobs of equal length: complexity, facets and computational results , 1996, Math. Program..

[6]  Laurence Wolsey,et al.  Strong formulations for mixed integer programming: A survey , 1989, Math. Program..

[7]  Fabrizio Rossi,et al.  A set packing model for the ground holding problem in congested networks , 2001, Eur. J. Oper. Res..

[8]  J. E. Mitchell,et al.  Analyzing and exploiting the structure of the constraints in the ILP approach to the scheduling problem , 1994, IEEE Trans. Very Large Scale Integr. Syst..

[9]  George J. Minty,et al.  On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory B.

[10]  Martin W. P. Savelsbergh,et al.  A polyhedral approach to single-machine scheduling problems , 1999, Math. Program..

[11]  Dimitris Alevras,et al.  Order preserving assignments without contiguity , 1997, Discret. Math..

[12]  Claudio Arbib,et al.  A competitive scheduling problem and its relevance to UMTS channel assignment , 2004, Networks.

[13]  Alper Atamt.  LOT SIZING WITH INVENTORY BOUNDS AND FIXED COSTS: POLYHEDRAL STUDY AND COMPUTATION , 2004 .

[14]  Robert D. Carr,et al.  101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem , 2001, RECOMB.

[15]  Frits C. R. Spieksma,et al.  Scheduling jobs of equal length: complexity, facets and computational results , 1995, Math. Program..

[16]  Maurice Queyranne,et al.  Polyhedral Approaches to Machine Scheduling , 2008 .

[17]  Laurence A. Wolsey,et al.  Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation , 2002, Manag. Sci..

[18]  Rolf H. Möhring,et al.  On project scheduling with irregular starting time costs , 2001, Oper. Res. Lett..

[19]  Maurice Queyranne,et al.  Single-Machine Scheduling Polyhedra with Precedence Constraints , 1991, Math. Oper. Res..

[20]  Rolf H. Möhring,et al.  Solving Project Scheduling Problems by Minimum Cut Computations , 2002, Manag. Sci..

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