Solving two-machine assembly scheduling problems with inventory constraints

Computers and Industrial Engineering

Volumn 63, Issue 1, 2012, Pages 120-134

  Terekhov, Daria ^a   Dogru, Mustafa K ^b   Özen, Ulaş ^b   Beck, J Christopher ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Assembly scheduling; Constraint programming; Inventory; Mixed integer programming; Order scheduling

Indexed keywords

ASSEMBLY SCHEDULING; CONSTRAINT PROGRAMMING; INVENTORY; MIXED-INTEGER PROGRAMMING; ORDER SCHEDULING;

COMPUTER PROGRAMMING; CONSTRAINT THEORY; INTEGER PROGRAMMING; MANUFACTURE; SUPPLY CHAINS;

SCHEDULING;

EID: 84857711203     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2012.02.006     Document Type: Article

References (59)

1. R.H. Ahmadi, and U. Bagchi Scheduling of multi-job customer orders in multi-machine environments ORSA/TIMS 1990
2. R. Ahmadi, U. Bagchi, and T. Roemer Coordinated scheduling of customer orders for quick response Naval Research Logistics 52 6 2005 493 512
3. M.S. Akturk, and D. Ozdemir An exact approach to minimizing total weighted tardiness with release dates IIE Transactions 32 2000 1091 1101
4. A. Allahverdi, and F.S. Al-Anzi A pso and tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application Computers and Operations Research 33 2006 1056 1080
5. P. Baptiste, P. Laborie, C. Le Pape, and W. Nuijten Constraint-based scheduling and planning F. Rossi, P. van Beek, T. Walsh, Handbook of constraint programming 2006 Elsevier 761 799
6. J.C. Beck Heuristics for scheduling with inventory: Dynamic focus via constraint criticality Journal of Scheduling 5 1 2002 43 69
7. J.C. Beck, A.J. Davenport, E.D. Davis, and M.S. Fox The ODO project: Toward a unified basis for constraint-directed scheduling Journal of Scheduling 1 2 1998 89 125
8. Berthold, T., Heinz, S., Lübbecke, M., Möhring, R., & Schulz, J. (2010). A constraint integer programming approach for resource-constrained project scheduling. In A. Lodi, M. Milano, & P. Toth, (Eds.), Proceedings of the seventh international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR'10). pp. 313-317.
9. J.D. Blocher, and D. Chhajed Minimizing customer order lead-time in a two-stage assembly supply chain Annals of Operations Research 161 2008 25 52
10. S. Bock, and M. Pinedo A decomposition scheme for single stage scheduling problems Journal of Scheduling 13 3 2010 203 212
11. Briskorn, D. (2010). Variable very large neighborhood algorithms for truck sequencing at transshipment terminals. Working Paper, Instituten für Betriebswirtschaftslehre der Universität Kiel.
12. Briskorn, D., Leung, J., (2010). Branch and bound algorithms for minimizing maximum lateness of trucks at a transshipment terminal. Working Paper, Instituten für Betriebswirtschaftslehre der Universität Kiel.
13. D. Briskorn, B.-C. Choi, K. Lee, J. Leung, and M. Pinedo Complexity of single machine scheduling subject to nonnegative inventory constraints European Journal of Operational Research 207 2 2010 605 619
14. Briskorn, D., Choi, B. -C., Lee, K., Leung, J., & Pinedo, M. (2009). Genetic algorithms for inventory constrained scheduling on a single machine. Tech. Rep. 649, Instituten für Betriebswirtschaftslehre der Universität Kiel. < http://www.bwl.uni-kiel.de/bwlinstitute/Prod/team/ briskorn/ga2009.pdf >.
15. P. Brucker, A. Drexl, R. Möhring, K. Neumann, and E. Pesch Resource-constrained project scheduling: Notation, classification, models, and methods European Journal of Operational Research 112 1 1999 3 41
16. M. Cadoli, and F. Patrizi On the separability of subproblems in Benders decompositions Annals of Operations Research 171 1 2009 27 43
17. X.Q. Cai, J. Chen, Y. Xiao, and X. Xu Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline Computers and Operations Research 35 2008 1671 1683
18. K. Chen, and P. Ji A mixed integer programming model for advanced planning and scheduling (APS) European Journal of Operational Research 181 2007 515 522
19. Coban, E., & Hooker, J. N. (2010). Single-facility scheduling over long time horizons by logic-based benders decomposition. In A. Lodi, M. Milano, & P. Toth, (Eds.), Proceedings of the seventh international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR'10) (pp. 87-91).
20. J. Du, and J.Y.-T. Leung Minimizing total tardiness on one machine is NP-hard Mathematics of Operations Research 15 1990 483 495
21. Fanti, M., Stecco, G., & Ukovich, W. (2010). Scheduling the internal operations in distribution centers with buffer constraints. In 6th Annual IEEE conference on automation science and engineering (CASE) (pp. 75-80). IEEE.
22. Fox, M. S. (1983). Constraint-directed search: A case study of job-shop scheduling. Ph.D. thesis. Carnegie Mellon University, Intelligent Systems Laboratory, The Robotics Institute, Pittsburgh, PA, CMU-RI-TR-85-7.
23. A. Grigoriev, M. Holthuijsen, and J. van de Klundert Basic scheduling problems with raw material constraints Naval Research Logistics 52 6 2005 527 535
24. A.M.A. Hariri, and C.N. Potts A branch and bound algorithm for the two-stage assembly scheduling problem European Journal of Operational Research 103 1997 547 556
25. S. Hartmann, and D. Briskorn A survey of variants and extensions of the resource-constrained project scheduling problem European Journal of Operational Research 207 1 2010 1 14
26. S.R. Hejazi, and S. Saghafian Flowshop-scheduling problems with makespan criterion: A review International Journal of Production Research 43 14 2005 2895 2929
27. W. Herroelen, B. De Reyck, and E. Demeulemeester Resource-constrained project scheduling: A survey of recent developments Computers and Operations Research 25 4 1998 279 302
28. J.N. Hooker, and G. Ottosson Logic-based Benders' decomposition Mathematical Programming 96 2003 33 60
29. Huang, H. L., & Lin, B. M. T. (2007). Concurrent openshop problem to minimize the weighted number of late jobs. In E. Levner (Eds.), Multiprocessor scheduling, theory and applications (p. 215). InTech.
30. A. Keha, K. Khowala, and J. Fowler Mixed integer programming formulations for single machine scheduling problems Computers & Industrial Engineering 56 1 2009 357 367
31. S.-S. Ko, and R.F. Serfozo Response times in M/M/s fork-join networks Advances in Applied Probability 36 3 2004 854 871
32. R. Kolisch Integrated scheduling, assembly area- and part-assignment for large-scale, make-to-order assemblies International Journal of Production Economics 64 1-3 2000 127 142
33. R. Kolisch, and K. Hess Efficient methods for scheduling make-to-order assemblies under resource, assembly area and part availability constraints International Journal of Production Research 38 2000 207 228
34. V. Kumar Algorithms for constraint satisfaction problems: A survey AI Magazine 1992 32 44
35. C.-Y. Lee, T.C.E. Cheng, and B.M.T. Lin Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem Management Science 39 1993 616 625
36. J.Y.-T. Leung, H. Li, and M. Pinedo Order scheduling in an environment with dedicated resources in parallel Journal of Scheduling 8 2005 355 386
37. J.Y.-T. Leung, H. Li, and M. Pinedo Order scheduling models: An overview G. Kendall, E.K. Burke, S. Petrovic, M. Gendreau, Multidisciplinary scheduling: Theory and applications 2005 Springer 37 53
38. J.Y.-T. Leung, H. Li, and M. Pinedo Scheduling orders for multiple product types to minimize total weighted completion time Discrete Applied Mathematics 155 2007 945 970
39. J. Leung, H. Li, M. Pinedo, and C. Sriskandarajah Open shops with jobs overlap-revisited European Journal of Operational Research 163 2 2005 569 571
40. C.-L. Li, and G. Vairaktarakis Coordinating production and distribution of jobs with bundling operations IIE Transactions 39 2007 203 215
41. B.M.T. Lin, and A.V. Kononov Customer order scheduling to minimize the number of late jobs European Journal of Operational Research 183 2007 944 948
42. M. Masin, M.O. Pasaogullari, and S. Joshi Dynamic scheduling of production-assembly networks in a distributed environment IIE Transactions 39 2007 395 409
43. M. Mastrolilli, M. Queyranne, A. Schulz, O. Svensson, and N. Uhan Minimizing the sum of weighted completion times in a concurrent open shop Operations Research Letters 38 5 2010 390 395
44. D.H.C. McKoy, and P.J. Egbelu Minimizing production flow time in a process and assembly job shop International Journal of Production Research 36 8 1998 2315 2332
45. K. Neumann, and C. Schwindt Project scheduling with inventory constraints Mathematical Methods of Operations Research 56 2002 513 533
46. L. Özdamar, and G. Ulusoy A survey on the resource-constrained project scheduling problem IIE Transactions 27 5 1995 574 586
47. S. Pathumnakul, and P.J. Egbelu An algorithm for minimizing weighted earliness penalty in assembly job shops International Journal of Production Economics 103 2006 230 245
48. P.R. Philipoom, R.S. Russell, and T.D. Fry A preliminary investigation of a multi-attribute based sequencing rules for assembly shops International Journal of Production Research 29 4 1991 739 753
49. M. Pinedo Scheduling: Theory, algorithms, and systems 2nd ed. 2003 Prentice-Hall
50. Pirkwieser, S. (2006). A Lagrangian decomposition approach combined with metaheuristics for the knapsack constrained maximum spanning tree problem. Master's thesis. Institute of Computer Graphics and Algorithms, Vienna University of Technology.
51. C. Potts, S. Sevast'janov, V. Strusevich, L. Van Wassenhove, and C. Zwaneveld The two-stage assembly scheduling problem: complexity and approximation Operations Research 43 1995 346 355
52. T. Roemer A note on the complexity of the concurrent open shop problem Journal of Scheduling 9 2006 389 396
53. Scheduler (2009). IBM ILOG Scheduler 6.7 User's Manual and Reference Manual. IBM ILOG.
54. X. Sun, K. Morizawa, and H. Nagasawa Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling European Journal of Operational Research 146 2003 498 516
55. C. Sung, and S.H. Yoon Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines International Journal of Production Economics 54 1998 247 255
56. S. Thiagarajan, and C. Rajendran Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs Computers and Industrial Engineering 49 2005 463 503
57. W.-J. van Hoeve, and I. Katriel Global constraints F. Rossi, P. van Beek, T. Walsh, Handbook of constraint programming 2006 Elsevier 169 208
58. J. Yang, and M.E. Posner Scheduling parallel machines for the customer order problem Journal of Scheduling 8 2005 49 74
59. M. Yokoyama Flow shop scheduling with setup and assembly operations European Journal of Operational Research 187 2008 1184 1195