References

1. Lenstra JK, Kan AR, Brucker P (1997) Complexity of machine scheduling problems. Annals of discrete mathematics 1: 343-362. View
2. M. Pinedo (2009) Planning and Scheduling in Manufacturing and Services. Springer Series in Operations Research and Financial Engineering, Springer Science+Business Media, LLC, 2nd ed.
3. Baker KR, Trietsch D (2009) Principles of Sequencing and Scheduling. Wiley Publishing. View
4. M. J. Melitz (2003) The impact of trade on intra-industry reallocations and aggregate industry productivity. Econometrica 71: 1695-1725. View
5. M. Edgett (2012) Three hot button areas in improving production efficiency. View
6. Blazewicz J, Ecker KH, Pesch E, Schmidt G, Weglarz J, et al. (2007) Handbook on Scheduling: From Theory to Applications. International Handbooks on Information Systems. Springer.
7. Asprova Corporation (2008) Lean Manufacturing. View
8. Leung JYT (2004) Handbook of Scheduling: Algorithms, Models and Performance Analysis. Computer and Information Science Series, Chapman and Hall/CRC, 1st ed. View
9. Bondy A, Murty USR (2007) Graph Theory (Graduate Texts in Mathematics). Springer, 3rd corrected printing ed.
10. Heller J, Schneiderman B (1972) A graph theoretic model of data structures. SIGIR Forum 7: 36-44. View
11. Mirza BJ (2001) Jumping connections: A graph-theoretic model for recommender systems. Master’s thesis, Virginia Polytechnic Institute and State University. View
12. Caramuta DM, Contiggiani F, Tohmé F (2006) Memory and similarity: a graph-theoretic model for case based decision theory. In XLI Meeting of the Argentina Association of Political Economy, Argentina Association of Political Economy. View
13. Sanmartí E, Friedler F, Puigjaner L (1998) Combinatorial technique for short term scheduling of multipurpose batch plants based on schedulegraph representation. Computers & Chemical Engineering 22: S847-S850. View
14. Sanmartí E, Friedler F, Puigjaner L, Holczinger T (2002) Combinatorial framework for effective scheduling of multipurpose batch plants. American Institute of Chemical Engineers (AIChE) 48: 2557-2570. View
15. Friedler F, Fan LT (2012) P-graph - introduction. View
16. Pantelides CC (1994) Unified frameworks for the optimal process planning and scheduling. In Proceedings of the 2nd Conference on the Foundations of Computer Aided Operations (D. W. T. Rippin, J. C. Hale, and J. F. Davis, eds.), American Institute of Chemical Engineers. CAST Division, CACHE.
17. Grossmann I (2010) STN Interface. View
18. Graham R (1980) Mathematics Today: Twelve Informal Essays, ch. Combinatorial Scheduling Theory 183-211. Springer-Verlag London Limited; Vintage Pr.
19. R. Graham, E. Lawler, J. Lenstra, and A. Rinnooy Kan, “Optimization and approximation in deterministic sequencing and scheduling- a survey,” in Annals of Discrete Mathematics (B. H. K. P. L. Hammer, E. L. Johnson, ed.), vol. Discrete Optimization II of 5, pp. 287–326, North-Holland Publishing Company, 1979.
20. Knust S, Brucker P (2009) Complexity results for scheduling problems. View
21. Lageweg BJ, Lawler EL, Lenstra JK, Kan AHGR (1981) Computer aided complexity classification of deterministic scheduling problems. Mathematisch Centrum, The Netherlands.
22. Lageweg BJ, Lawler EL, Lenstra JK, Kan AHGR (1982) Computer-aided complexity classification of combinatorial problems. Communications of the ACM 25: 817-822. View
23. Dürr C (2010) The scheduling zoo. View