260
Views
2
CrossRef citations to date
0
Altmetric
Scheduling & Logistics

Generation of low-dimensional capacity constraints for parallel machines

& ORCID Icon
Pages 1189-1205 | Received 27 Oct 2015, Accepted 30 Jun 2017, Published online: 27 Oct 2017

References

  • Avis, D., Bremner, D. and Seidel, R. (1997) How good are convex hull algorithms? Computational Geometry, 7(5), 265–301.
  • Avis, D. and Fukuda, K. (1992) A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete and Computational Geometry, 8(1), 295–313.
  • Avis, D. and Roumanis, G. (2013) A portable parallel implementation of the LRS vertex enumeration code. Lecture Notes in Computer Science, 8287, 414–429.
  • Bermon, S. and Hood, S.J. (1999) Capacity optimization planning system. Interfaces, 29(5), 31–50.
  • Centeno, G. and Armacost, R.L. (2004) Minimizing makespan on parallel machines with release time and machine eligibility restrictions. International Journal of Production Research, 42(6), 1243–1256.
  • Chung, S.-H., Huang, C.-Y. and Lee, A.H.I. (2008) Heuristic algorithms to solve the capacity allocation problem in photolithography area. OR Spectrum, 30(3), 431–452.
  • Fukuda, K. (2004) From the zonotope construction to the Minkowski addition of convex polytopes. Journal of Symbolic Computation, 38(4), 1261–1272.
  • Fukuda, K. (2008) cddlib Reference Manual, Swiss Federal Institute of Technology, Zurich, Switzerland.
  • Fukuda, K. and Prodon, A. (1996) Double description method revisited. Lecture Notes in Computer Science, 1120, 91–111.
  • Fukuda, K. and Weibel, C. (2007) f-Vectors of Minkowski additions of convex polytopes. Discrete and Computational Geometry, 37(4), 503–516.
  • Fukuda, K. and Weibel, C. (2009) Facet computation for Minkowski sums of polytopes. Technical report, Swiss Federal Institute of Technology, Zurich, Switzerland.
  • Garey, M.R. and Johnson, D.S. (1979) Computers and Intractability: A Guide to NP-Completeness, Freeman, New York, NY.
  • Grünbaum, B. (2003) Convex Polytopes, Springer, New York, NY.
  • Hackman, S.T. and Leachman, R.C. (1989) A general framework for modeling production. Management Science, 35(4), 478–495.
  • Hopp, W.J. and Spearman, M.L. (2011) Factory Physics, Waveland, Long Grove, IL.
  • Hung, Y.-F. and Cheng, G.-J. (2002) Hybrid capacity modeling for alternative machine types in linear programming production planning. IIE Transactions, 34, 157–165.
  • Johnson, L.A. and Montgomery, D.C. (1974) Operations Research in Production Planning, Scheduling, and Inventory Control, Wiley, New York, NY.
  • Kim, D.-W., Kim, K.-H., Jang, W. and Chen, F. (2002) Unrelated parallel machine scheduling with setup times using simulated annealing. Robotics and Computer-Integrated Manufacturing, 18(3), 223–231.
  • Leachman, R.C. and Carmon, T.F. (1992) On capacity modeling for production planning with alternative machine types. IIE Transactions, 24(4), 62–72.
  • Lee, Y.H., Park, J. and Kim, S. (2002) Experimental study on input and bottleneck scheduling for a semiconductor fabrication line. IIE Transactions, 34(2), 179–190.
  • Liberopoulos, G. (2002) Production capacity modeling of alternative, nonidentical, flexible machines. International Journal of Flexible Manufacturing Systems, 14(4), 345–359.
  • Logendran, R. and Subur, F. (2004) Unrelated parallel machine scheduling with job splitting. IIE Transactions, 36(4), 359–372.
  • Missbauer, H. and Uzsoy, R. (2011) Optimization models of production planning problems, in K.G. Kempf, P. Keskinocak, R. Uzsoy (eds), Planning Production and Inventories in the Extended Enterprise, Springer, New York, NY, pp. 437–507.
  • Mönch, L., Fowler, J.W. and Mason, S.J. (2013) Production Planning and Control for Semiconductor Wafer Fabrication Facilities, Springer, New York, NY.
  • Motzkin, T.S., Raiffa, H., Thompson, G.L. and Thrall, R.M. (1953) The double description method, in H. W. Kuhn & A. W. Tucker (eds), Contributions to the Theory of Games, volume 2, Princeton University Press, Princeton, NJ, pp. 51–73.
  • Pinedo, M. (2012) Scheduling: Theory, Algorithms, and Systems, Springer, New York, NY.
  • Sanders, P. and Schulz, C. (2013) Think locally, act globally: Highly balanced graph partitioning. Lecture Notes in Computer Science, 7933, 164–175.
  • Selçuk, B., Fransoo, J.C. and de Kok, A.G. (2008) Work-in-process clearing in supply chain operations planning. IIE Transactions, 40(3), 206–220.
  • Song, Y., Zhang, M.T., Yi, J., Zhang, L. and Zheng, L. (2007) Bottleneck station scheduling in semiconductor assembly and test manufacturing using ant colony optimization. IEEE Transactions on Automation Science and Engineering, 4(4), 569–578.
  • Tiwary, H.R. (2008) On the hardness of computing intersection, union and Minkowski sum of polytopes. Discrete and Computational Geometry, 40(3), 469–479.
  • Uzsoy, R., Lee, C.-Y. and Martin-Vega, L.A. (1992) A review of production planning and scheduling models in the semiconductor industry part I: System characteristics, performance evaluation and production planning. IIE Transactions, 24(4), 47–60.
  • Uzsoy, R., Lee, C.-Y. and Martin-Vega, L.A. (1994) A review of production planning and scheduling models in the semiconductor industry part II: Shop-floor control. IIE Transactions, 26(5), 44–55.
  • Vollmann, T.E., Berry, W.L. and Whybark, D.C. (1997) Manufacturing Planning and Control Systems, Irwin/McGraw-Hill, New York, NY.
  • Weibel, C. (2010) Implementation and parallelization of a reverse-search algorithm for Minkowski sums, in Proceedings of the 12th Workshop on Algorithm Engineering and Experiments (ALENEX), SIAM, Austin, TX, pp. 34–42.
  • Yu, L., Shih, H.M., Pfund, M., Carlyle, W.M. and Fowler, J.W. (2002) Scheduling of unrelated parallel machines: An application to PWB manufacturing. IIE Transactions, 34(11), 921–931.
  • Ziegler, G.M. (2007) Lectures on Polytopes, in S. Axler, F.W. Gehring, K.A. Ribet (eds.), Graduate Texts in Mathematics, p. 152. Springer, New York, NY.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.