Modeling the supply chain configuration problem with resource constraints

Abstract In this paper, we study the supply chain configuration problem (SCCP) under resource constraints. We present a new modeling framework based on multi-mode resource-constrained project scheduling (MRCPSP) for configuring the supply chain subject to explicit resource constraints. It establishes a bridge between the areas of project scheduling and supply chain design. Our model is also able to handle additional practical issues such as quality level requirements and general temporal constraints , which are often encountered in the real world. A constraint programming (CP) based solution approach is proposed and implemented in our case study. Conclusions and future research directions are discussed.

[1]  Fayez F. Boctor,et al.  A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes , 1996 .

[2]  Peter Brucker,et al.  Scheduling and constraint propagation , 2002, Discret. Appl. Math..

[3]  Jan Węglarz.  On Certain Models of Resource Allocation Problems , 1978 .

[4]  Michael Pinedo,et al.  Planning and Scheduling in Manufacturing and Services , 2008 .

[5]  John N. Hooker,et al.  Logic, Optimization, and Constraint Programming , 2002, INFORMS J. Comput..

[6]  Andreas Drexl,et al.  Scheduling of Project Networks by Job Assignment , 1991 .

[7]  Fayez F. Boctor,et al.  Resource-constrained project scheduling by simulated annealing , 1996 .

[8]  Philippe Baptiste,et al.  Constraint - based scheduling : applying constraint programming to scheduling problems , 2001 .

[9]  Sean P. Willems,et al.  Optimizing the Supply Chain Configuration for New Products , 2005, Manag. Sci..

[10]  Hau L. Lee,et al.  Design for Postponement , 2003, Supply Chain Management.

[11]  Sönke Hartmann.  Project Scheduling under Limited Resources: Models, Methods, and Applications , 2000 .

[12]  Bert De Reyck,et al.  The multi-mode resource-constrained project scheduling problem with generalized precedence relations , 1999, Eur. J. Oper. Res..

[13]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[14]  Rainer Kolisch,et al.  Project Scheduling under Resource Constraints: Efficient Heuristics for Several Problem Classes , 1995 .

[15]  Eric Pinson,et al.  A Practical Use of Jackson''s Preemptive Schedule for Solving the Job-Shop Problem. Annals of Opera , 1991 .

[16]  Jwm Will Bertrand,et al.  Supply Chain Design: Flexibility Considerations , 2003, Supply Chain Management.

[17]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

[18]  Pierre Lopez,et al.  Overview and Possible Extensions of Shaving Techniques for Job-Shop Problems ! , 2000 .

[19]  J. We¸Glarz,et al.  ON CERTAIN MODELS OF RESOURCE ALLOCATION PROBLEMS , 1980 .

[20]  Andreas Drexl,et al.  Nonpreemptive multi-mode resource-constrained project scheduling , 1993 .

[21]  S. Graves,et al.  Supply chain management : design, coordination and operation , 2003 .

[22]  Professor Dr. Klaus Neumann,et al.  Project Scheduling with Time Windows and Scarce Resources , 2003, Springer Berlin Heidelberg.

[23]  J. Shapiro.  Modeling the Supply Chain , 2000 .

[24]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[25]  Philippe Baptiste,et al.  Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems , 1999, Ann. Oper. Res..

[26]  David Simchi-Levi,et al.  Supply Chain Design and Planning - Applications of Optimization Techniques for Strategic and Tactical Models , 2003, Supply Chain Management.

[27]  F. Brian Talbot,et al.  Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case , 1982 .