How to cite this paper
Gharaei, A., Naderi, B & Mohammadi, M. (2015). Optimization of rewards in single machine scheduling in the rewards-driven systems.Management Science Letters , 5(6), 629-638.
Refrences
Adams, J. S.(1965). Injustice in Social Exchange. In Berkowitz, L. (Ed.) Advances in experimental social psychology. 2, New York: Academic Press, 267-299.
Anderson, D., & Moodie, C. (1969). Optimal buffer storage capacity in production line systems. International Journal of Production Research, 7(3), 233–240.
Bachman, A., & Janiak, A. (2004). Scheduling jobs with position-dependent processing times. Journal of the Operational Research Society, 55(3), 257-264.
Bai, J., Li, Z. R., & Huang, X. (2012). Single-machine group scheduling with general deterioration and learning effects. Applied Mathematical Modelling,36(3), 1267-1274.
Bai, J., Wang, M. Z., & Wang, J. B. (2012). Single machine scheduling with a general exponential learning effect. Applied Mathematical Modelling, 36(2), 829-835.
Baker, K.R.(1974). Introduction to Sequencing and Scheduling. John Wiley, New York.
Baker, K.R.(1995). Elements of Sequencing and Scheduling. Dartmouth College, Hanover, NH.
Balut, S. J. (1973). Scheduling to minimize the number of late jobs when set-up and processing times are uncertain. Management Science, 19(11), 1283-1288.
Banerjee, B. P. (1965). Single facility sequencing with random execution times.Operations research, 13(3), 358-364.
Baptiste, P. (1999). Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. Journal of Scheduling, 2(6), 245-252.
Biskup, D. (1999). Single-machine scheduling with learning considerations.European Journal of Operational Research, 115(1), 173-178.
Biskup, D. (2008). A state-of-the-art review on scheduling with learning effects.European Journal of Operational Research, 188(2), 315-329.
Boxma, O. J., & Forst, F. G. (1986). Minimizing the expected weighted number of tardy jobs in stochastic flow shops. Operations Research Letters, 5(3), 119-126.
Cai, X., & Zhou, X. (2005). Single-machine scheduling with exponential processing times and general stochastic cost functions. Journal of Global Optimization, 31(2), 317-332.
Cai, X., & Zhou, S. (1997). Scheduling stochastic jobs with asymmetric earliness and tardiness penalties. Naval Research Logistics (NRL), 44(6), 531-557.
Cheng, T. E., Wu, C. C., & Lee, W. C. (2008). Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects.Information Sciences, 178(11), 2476-2487.
Jia, C. (2001). Stochastic single machine scheduling with an exponentially distributed due date. Operations Research Letters, 28(5), 199-203.
Conway, R.W., Maxwell, W.L., & Miller, L.W. (1967). Theory of scheduling. Addison-Wesley, Reading, MA.
Dauzère-Pérès, S., & Sevaux, M. (2004). An exact method to minimize the number of tardy jobs in single machine scheduling. Journal of scheduling, 7(6), 405-420.
De, P., Ghosh, J. B., & Wells, C. E. (1991). On the minimization of the weighted number of tardy jobs with random processing times and deadline. Computers & Operations Research, 18(5), 457-463.
French, S. (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. John Wiley, New York.
Frenk, J. B. G. (1991). A general framework for stochastic one-machine scheduling problems with zero release times and no partial ordering. Probability in the Engineering and Informational Sciences, 5(3), 297-315.
Gen, M.(1997). Genetic algorithm and engineering design. John Wiley & Sons, New York, NY, USA.
Gerhart, B., & Milkovich, G. T.(1992). Employee Compensation: Research and Practice. In M. D. Dunnette and L. M. Hough (Eds.) Handbook of Industrial and Organizational Psychology, Palo Alto, CA: Consulting Psychologists Press, 2nd ed. , Vol. 3, pp. 475-569.
Gill, P.E., & Wong, E. (2010). Sequential Quadratic Programming Methods. UCSD Department of Mathematics. Technical Report NA-10-03.
Jang, W. (2002). Dynamic scheduling of stochastic jobs on a single machine.European Journal of Operational Research, 138(3), 518-530.
Janiak, A., & Rudek, R. (2009). Experience-based approach to scheduling problems with the learning effect. IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans, 39(2), 344-357.
Jolai, F. (2005). Minimizing number of tardy jobs on a batch processing machine with incompatible job families. European Journal of Operational Research, 162(1), 184-190.
Kayvanfar, V., Mahdavi, I., & Komaki, G. M. (2013). Single machine scheduling with controllable processing times to minimize total tardiness and earliness. Computers & Industrial Engineering, 65(1), 166-175.
Kuo, W. H., & Yang, D. L. (2011). A note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effects. Journal of the Operational Research Society, 62(1), 206-210.
Lai, P. J., & Lee, W. C. (2011). Single-machine scheduling with general sum-of-processing-time-based and position-based learning effects. Omega, 39(5), 467-471.
Lawler, E.E. (1971). Pay and Organizational Effectiveness: A Psychological View. New York: MacGraw-Hill.
Lawler, E. E. (1973). Motivation in Work Organizations. Monterey, CA: Brooks/Cole.
Lawler, E.E. (1990). Strategic Pay: Aligning Organizational Strategies and Pay Systems. San Francisco, CA: Jossey-Bass.
Lee, W. C., Wu, C. C., & Hsu, P. H. (2010). A single-machine learning effect scheduling problem with release times. Omega, 38(1), 3-11.
Mobley, W.H. (1982). Employee Turnover: Causes, Consequences, and Control, Reading. MA: Addison-Wesley.
Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15(1), 102-109.
Morton, T.E., & Pentico, D.W. (1993). Heuristic Scheduling Systems. John Wiley, New York.
Naderi, B., & Roshanaei, V.(2014). No-idle time scheduling of open shops: modeling and metaheuristic solution. International Journal of Supply and Operations Management, 1, 54-68.
Panneerselvam, S., & Sockalingam, N. (2010). Literature review of single machine scheduling Problem with uniform parallel machines. Intelligent Information Management, 2, 457-474.
Pinedo, M. (1983). Stochastic scheduling with release dates and due dates. Operation Research, 31, 559-572.
Pinedo, M.L.(2002). Scheduling: Theory, Algorithms, and Systems. 2nd Ed. Prentice Hall.
Pinedo, M., & Schrage, S. (1981). Stochastic shop scheduling: A survey, in: Deterministic and stochastic scheduling. M.A.H. Dempster, J.K. Lenstra and A.H.G. Rinnooy Kan (eds.), Reidel Dordrecht 181-196.
Portougal, V., & Trietsch, D. (2006). Setting due dates in a stochastic single machine environment. Computers & Operations Research, 33, 1681–1694.
Sarin, S., Erdel, E., & Steiner, G.(1991). Sequencing jobs on a single machine with a common due date and stochastic processing times. European Journal of Operational Research, 27, 188–198.
Seo, D.K., Klein, C.M., & Jang, W. (2005). Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models. Computers & Industrial Engineering, 48, 153-161.
Soroush, H. (1999). Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs. European Journal of Operations Research, 113, 450–468.
Soroush, H., & Fredendall, L. (1994). The stochastic single machine scheduling problem with earliness and tardiness costs. European Journal of Operational Research, 77, 287–302.
Vroom, V. H. (1964). Work and Motivation. New York: Wiley.
Weiss, G. (1981). Multi server stochastic scheduling, in: Deterministic and stochastic scheduling. M.A.H. Dempster, J.K. Lenstra and A.H.G. Rinnooy Kan (eds.), Reidel Dordrecht 157-180.
Wu, C., Brown, K., & Beck, J. (2009). Scheduling with uncertain durations: Modeling b-robust scheduling with constraints. Computers & Operations Research, 36, 2348–2356.
Xu, K., Feng, Z., & Jun, K. (2010). A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates. Computers & Operations Research, 37(11), 1924–1938.
Yang, S. J. (2011). Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine. Applied Mathematical Modelling, 35(8), 4008-4016.
Yin, Y., & Xu, D. (2011). Some single-machine scheduling problems with general effects of learning and deterioration. Computers & Mathematics with Applications, 61(1), 100-108.
Zhang, X., & Yan, G. (2010). Machine scheduling problems with a general learning effect. Mathematical and Computer Modelling, 51(1), 84-90.
Zhu, Z. (2005). An efficient sequential quadratic programming algorithm for nonlinear programming. Journal of Computational and Applied Mathematics,175(2), 447-464.
Zhu, Z., Sun, L., Chu, F., & Liu, M. (2011). Single-machine group scheduling with resource allocation and learning effect. Computers & Industrial Engineering, 60(1), 148-157.
Anderson, D., & Moodie, C. (1969). Optimal buffer storage capacity in production line systems. International Journal of Production Research, 7(3), 233–240.
Bachman, A., & Janiak, A. (2004). Scheduling jobs with position-dependent processing times. Journal of the Operational Research Society, 55(3), 257-264.
Bai, J., Li, Z. R., & Huang, X. (2012). Single-machine group scheduling with general deterioration and learning effects. Applied Mathematical Modelling,36(3), 1267-1274.
Bai, J., Wang, M. Z., & Wang, J. B. (2012). Single machine scheduling with a general exponential learning effect. Applied Mathematical Modelling, 36(2), 829-835.
Baker, K.R.(1974). Introduction to Sequencing and Scheduling. John Wiley, New York.
Baker, K.R.(1995). Elements of Sequencing and Scheduling. Dartmouth College, Hanover, NH.
Balut, S. J. (1973). Scheduling to minimize the number of late jobs when set-up and processing times are uncertain. Management Science, 19(11), 1283-1288.
Banerjee, B. P. (1965). Single facility sequencing with random execution times.Operations research, 13(3), 358-364.
Baptiste, P. (1999). Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. Journal of Scheduling, 2(6), 245-252.
Biskup, D. (1999). Single-machine scheduling with learning considerations.European Journal of Operational Research, 115(1), 173-178.
Biskup, D. (2008). A state-of-the-art review on scheduling with learning effects.European Journal of Operational Research, 188(2), 315-329.
Boxma, O. J., & Forst, F. G. (1986). Minimizing the expected weighted number of tardy jobs in stochastic flow shops. Operations Research Letters, 5(3), 119-126.
Cai, X., & Zhou, X. (2005). Single-machine scheduling with exponential processing times and general stochastic cost functions. Journal of Global Optimization, 31(2), 317-332.
Cai, X., & Zhou, S. (1997). Scheduling stochastic jobs with asymmetric earliness and tardiness penalties. Naval Research Logistics (NRL), 44(6), 531-557.
Cheng, T. E., Wu, C. C., & Lee, W. C. (2008). Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects.Information Sciences, 178(11), 2476-2487.
Jia, C. (2001). Stochastic single machine scheduling with an exponentially distributed due date. Operations Research Letters, 28(5), 199-203.
Conway, R.W., Maxwell, W.L., & Miller, L.W. (1967). Theory of scheduling. Addison-Wesley, Reading, MA.
Dauzère-Pérès, S., & Sevaux, M. (2004). An exact method to minimize the number of tardy jobs in single machine scheduling. Journal of scheduling, 7(6), 405-420.
De, P., Ghosh, J. B., & Wells, C. E. (1991). On the minimization of the weighted number of tardy jobs with random processing times and deadline. Computers & Operations Research, 18(5), 457-463.
French, S. (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. John Wiley, New York.
Frenk, J. B. G. (1991). A general framework for stochastic one-machine scheduling problems with zero release times and no partial ordering. Probability in the Engineering and Informational Sciences, 5(3), 297-315.
Gen, M.(1997). Genetic algorithm and engineering design. John Wiley & Sons, New York, NY, USA.
Gerhart, B., & Milkovich, G. T.(1992). Employee Compensation: Research and Practice. In M. D. Dunnette and L. M. Hough (Eds.) Handbook of Industrial and Organizational Psychology, Palo Alto, CA: Consulting Psychologists Press, 2nd ed. , Vol. 3, pp. 475-569.
Gill, P.E., & Wong, E. (2010). Sequential Quadratic Programming Methods. UCSD Department of Mathematics. Technical Report NA-10-03.
Jang, W. (2002). Dynamic scheduling of stochastic jobs on a single machine.European Journal of Operational Research, 138(3), 518-530.
Janiak, A., & Rudek, R. (2009). Experience-based approach to scheduling problems with the learning effect. IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans, 39(2), 344-357.
Jolai, F. (2005). Minimizing number of tardy jobs on a batch processing machine with incompatible job families. European Journal of Operational Research, 162(1), 184-190.
Kayvanfar, V., Mahdavi, I., & Komaki, G. M. (2013). Single machine scheduling with controllable processing times to minimize total tardiness and earliness. Computers & Industrial Engineering, 65(1), 166-175.
Kuo, W. H., & Yang, D. L. (2011). A note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effects. Journal of the Operational Research Society, 62(1), 206-210.
Lai, P. J., & Lee, W. C. (2011). Single-machine scheduling with general sum-of-processing-time-based and position-based learning effects. Omega, 39(5), 467-471.
Lawler, E.E. (1971). Pay and Organizational Effectiveness: A Psychological View. New York: MacGraw-Hill.
Lawler, E. E. (1973). Motivation in Work Organizations. Monterey, CA: Brooks/Cole.
Lawler, E.E. (1990). Strategic Pay: Aligning Organizational Strategies and Pay Systems. San Francisco, CA: Jossey-Bass.
Lee, W. C., Wu, C. C., & Hsu, P. H. (2010). A single-machine learning effect scheduling problem with release times. Omega, 38(1), 3-11.
Mobley, W.H. (1982). Employee Turnover: Causes, Consequences, and Control, Reading. MA: Addison-Wesley.
Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15(1), 102-109.
Morton, T.E., & Pentico, D.W. (1993). Heuristic Scheduling Systems. John Wiley, New York.
Naderi, B., & Roshanaei, V.(2014). No-idle time scheduling of open shops: modeling and metaheuristic solution. International Journal of Supply and Operations Management, 1, 54-68.
Panneerselvam, S., & Sockalingam, N. (2010). Literature review of single machine scheduling Problem with uniform parallel machines. Intelligent Information Management, 2, 457-474.
Pinedo, M. (1983). Stochastic scheduling with release dates and due dates. Operation Research, 31, 559-572.
Pinedo, M.L.(2002). Scheduling: Theory, Algorithms, and Systems. 2nd Ed. Prentice Hall.
Pinedo, M., & Schrage, S. (1981). Stochastic shop scheduling: A survey, in: Deterministic and stochastic scheduling. M.A.H. Dempster, J.K. Lenstra and A.H.G. Rinnooy Kan (eds.), Reidel Dordrecht 181-196.
Portougal, V., & Trietsch, D. (2006). Setting due dates in a stochastic single machine environment. Computers & Operations Research, 33, 1681–1694.
Sarin, S., Erdel, E., & Steiner, G.(1991). Sequencing jobs on a single machine with a common due date and stochastic processing times. European Journal of Operational Research, 27, 188–198.
Seo, D.K., Klein, C.M., & Jang, W. (2005). Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models. Computers & Industrial Engineering, 48, 153-161.
Soroush, H. (1999). Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs. European Journal of Operations Research, 113, 450–468.
Soroush, H., & Fredendall, L. (1994). The stochastic single machine scheduling problem with earliness and tardiness costs. European Journal of Operational Research, 77, 287–302.
Vroom, V. H. (1964). Work and Motivation. New York: Wiley.
Weiss, G. (1981). Multi server stochastic scheduling, in: Deterministic and stochastic scheduling. M.A.H. Dempster, J.K. Lenstra and A.H.G. Rinnooy Kan (eds.), Reidel Dordrecht 157-180.
Wu, C., Brown, K., & Beck, J. (2009). Scheduling with uncertain durations: Modeling b-robust scheduling with constraints. Computers & Operations Research, 36, 2348–2356.
Xu, K., Feng, Z., & Jun, K. (2010). A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates. Computers & Operations Research, 37(11), 1924–1938.
Yang, S. J. (2011). Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine. Applied Mathematical Modelling, 35(8), 4008-4016.
Yin, Y., & Xu, D. (2011). Some single-machine scheduling problems with general effects of learning and deterioration. Computers & Mathematics with Applications, 61(1), 100-108.
Zhang, X., & Yan, G. (2010). Machine scheduling problems with a general learning effect. Mathematical and Computer Modelling, 51(1), 84-90.
Zhu, Z. (2005). An efficient sequential quadratic programming algorithm for nonlinear programming. Journal of Computational and Applied Mathematics,175(2), 447-464.
Zhu, Z., Sun, L., Chu, F., & Liu, M. (2011). Single-machine group scheduling with resource allocation and learning effect. Computers & Industrial Engineering, 60(1), 148-157.