How to cite this paper
Ahmadi-Darani, M., Moslehi, G & Reisi-Nafchi, M. (2018). A two-agent scheduling problem in a two-machine flowshop.International Journal of Industrial Engineering Computations , 9(3), 289-306.
Refrences
Agnetis, A., Billaut, J.-C., Gawiejnowicz, S., Pacciarelli, D., & Souhal, A. (2014). Multi-agent scheduling. Berlin: Springer Berlin Heidelberg.
Agnetis, A., Mirchandani, P. B., Pacciarelli, D., & Pacifici, A. (2004). Scheduling Problems with Two Competing Agents. Operations Research, 52(2), 229-242. doi:10.2307/30036575
Agnetis, A., Pacciarelli, D., & Pacifici, A. (2007). Multi-agent single machine scheduling. Annals of Operations Research, 150(1), 3-15. doi:10.1007/s10479-006-0164-y
Akkan, C., & Karabatı, S. (2004). The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm. European Journal of Operational Research, 159(2), 420-429.
Baker, K. R., & Smith, J. C. (2003). A multiple-criterion model for machine scheduling. Journal of Scheduling, 6(1), 7-16.
Chandra, P., Mehta, P., & Tirupati, D. (2009). Permutation flow shop scheduling with earliness and tardiness penalties. International Journal of Production Research, 47(20), 5591-5610.
Cheng, T. E., Wu, W.-H., Cheng, S.-R., & Wu, C.-C. (2011). Two-agent scheduling with position-based deteriorating jobs and learning effects. Applied Mathematics and Computation, 217(21), 8804-8824.
Della Croce, F., Ghirardi, M., & Tadei, R. (2002). An improved branch-and-bound algorithm for the two machine total completion time flow shop problem. European Journal of Operational Research, 139(2), 293-301.
Della Croce, F., Narayan, V., & Tadei, R. (1996). The two-machine total completion time flow shop problem. European Journal of Operational Research, 90(2), 227-237.
Fan, B. Q., & Cheng, T. C. E. (2016). Two-agent scheduling in a flowshop. European Journal of Operational Research, 252(2), 376-384. doi:10.1016/j.ejor.2016.01.009
Gajpal, Y., Dua, A., & Sahu, S. N. (2014). Heuristics for single machine scheduling under competition to minimize total weighted completion time and makespan objectives. Lecture Notes in Management Science, 6, 99-105.
Glover, F. (1989). Tabu search-part I. ORSA Journal on computing, 1(3), 190-206.
Glover, F. (1990). Tabu search—part II. ORSA Journal on computing, 2(1), 4-32.
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287-326.
Haouari, M., & Kharbeche, M. (2013). An assignment-based lower bound for a class of two-machine flow shop problems. Computers & Operations Research, 40(7), 1693-1699.
Hoogeveen, J., & Velde, S. v. d. (1995). Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Operations Research Letters, 205-208.
Johnson, S. M. (1954). Optimal two‐and three‐stage production schedules with setup times included. Naval research Logistics Quarterly, 1(1), 61-68.
Józefowska, J., Jurisch, B., & Kubiak, W. (1994). Scheduling shops to minimize the weighted number of late jobs. Operations Research Letters, 16(5), 277-283.
Kellerer, H., & Strusevich, V. A. (2010). Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica, 57(4), 769-795.
Kharbeche, M., & Haouari, M. (2012). MIP models for minimizing total tardiness in a two-machine flow shop. Journal of the Operational Research Society, 64(5), 690-707.
Kim, Y.-D. (1993). A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops. Computers & Operations Research, 20(4), 391-401.
Lee, W.-C., Chen, S.-K., Chen, C.-W., & Wu, C.-C. (2011). A two-machine flowshop problem with two agents. Computers & Operations Research, 38(1), 98-104. doi:10.1016/j.cor.2010.04.002
Lee, W.-C., Chen, S.-k., & Wu, C.-C. (2010). Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem. Expert Systems with Applications, 37(9), 6594-6601.
Lei, D. (2015). Variable neighborhood search for two-agent flow shop scheduling problem. Computers & Industrial Engineering, 80, 125-131. doi:http://dx.doi.org/10.1016/j.cie.2014.11.024
Lenstra, J. K., Kan, A. R., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343-362.
Leung, J. Y. T., Pinedo, M., & Wan, G. (2010). Competitive Two-Agent Scheduling and Its Applications. Operations Research, 58(2), 458-469. doi:10.2307/40605929
Liu, P., Yi, N., Zhou, X., & Gong, H. (2013). Scheduling two agents with sum-of-processing-times-based deterioration on a single machine. Applied Mathematics and Computation, 219(17), 8848-8855.
Luo, W., Chen, L., & Zhang, G. (2012). Approximation schemes for two-machine flow shop scheduling with two agents. Journal of Combinatorial Optimization, 24(3), 229-239.
M’Hallah, R. (2014). Minimizing total earliness and tardiness on a permutation flow shop using VNS and MIP. Computers & Industrial Engineering, 75, 142-156.
Pan, J. C.-H., Chen, J.-S., & Chao, C.-M. (2002). Minimizing tardiness in a two-machine flow-shop. Computers & Operations Research, 29(7), 869-885.
Pan, J. C.-H., & Fan, E.-T. (1997). Two-machine flowshop scheduling to minimize total tardiness. International Journal of Systems Science, 28(4), 405-414.
Perez-Gonzalez, P., & Framinan, J. M. (2014). A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems. European Journal of Operational Research, 235(1), 1-16. Pinedo, M. (2002). Scheduling-Theory, Algorithms, and Analysis. New Jersey: Prentice-Hall.
Schaller, J. (2005). Note on minimizing total tardiness in a two-machine flowshop. Computers & Operations Research, 32(12), 3273-3281.
Sen, T., Dileepan, P., & Gupia, J. N. (1989). The two-machine flowshop scheduling problem with total tardiness. Computers & Operations Research, 16(4), 333-340.
Shiau, Y.-R., Tsai, M.-S., Lee, W.-C., & Cheng, T. C. E. (2015). Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time. Computers & Industrial Engineering, 87, 580-589.
Wu, C.-C., Huang, S.-K., & Lee, W.-C. (2011). Two-agent scheduling with learning consideration. Computers & Industrial Engineering, 61(4), 1324-1335.
Wu, W.-H. (2014). Solving a two-agent single-machine learning scheduling problem. International Journal of Computer Integrated Manufacturing, 27(1), 20-35.
Wu, W.-H., Xu, J., Wu, W.-H., Yin, Y., Cheng, I. F., & Wu, C.-C. (2013). A tabu method for a two-agent single-machine scheduling with deterioration jobs. Computers & Operations Research, 40(8), 2116-2127. doi:10.1016/j.cor.2013.02.025
Yin, Y., Cheng, S.-R., & Wu, C.-C. (2012a). Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties. Information Sciences, 189, 282-292. doi:10.1016/j.ins.2011.11.035
Yin, Y., Wu, W.-H., Cheng, S.-R., & Wu, C.-C. (2012b). An investigation on a two-agent single-machine scheduling problem with unequal release dates. Computers & Operations Research, 39(12), 3062-3073.
Agnetis, A., Mirchandani, P. B., Pacciarelli, D., & Pacifici, A. (2004). Scheduling Problems with Two Competing Agents. Operations Research, 52(2), 229-242. doi:10.2307/30036575
Agnetis, A., Pacciarelli, D., & Pacifici, A. (2007). Multi-agent single machine scheduling. Annals of Operations Research, 150(1), 3-15. doi:10.1007/s10479-006-0164-y
Akkan, C., & Karabatı, S. (2004). The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm. European Journal of Operational Research, 159(2), 420-429.
Baker, K. R., & Smith, J. C. (2003). A multiple-criterion model for machine scheduling. Journal of Scheduling, 6(1), 7-16.
Chandra, P., Mehta, P., & Tirupati, D. (2009). Permutation flow shop scheduling with earliness and tardiness penalties. International Journal of Production Research, 47(20), 5591-5610.
Cheng, T. E., Wu, W.-H., Cheng, S.-R., & Wu, C.-C. (2011). Two-agent scheduling with position-based deteriorating jobs and learning effects. Applied Mathematics and Computation, 217(21), 8804-8824.
Della Croce, F., Ghirardi, M., & Tadei, R. (2002). An improved branch-and-bound algorithm for the two machine total completion time flow shop problem. European Journal of Operational Research, 139(2), 293-301.
Della Croce, F., Narayan, V., & Tadei, R. (1996). The two-machine total completion time flow shop problem. European Journal of Operational Research, 90(2), 227-237.
Fan, B. Q., & Cheng, T. C. E. (2016). Two-agent scheduling in a flowshop. European Journal of Operational Research, 252(2), 376-384. doi:10.1016/j.ejor.2016.01.009
Gajpal, Y., Dua, A., & Sahu, S. N. (2014). Heuristics for single machine scheduling under competition to minimize total weighted completion time and makespan objectives. Lecture Notes in Management Science, 6, 99-105.
Glover, F. (1989). Tabu search-part I. ORSA Journal on computing, 1(3), 190-206.
Glover, F. (1990). Tabu search—part II. ORSA Journal on computing, 2(1), 4-32.
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287-326.
Haouari, M., & Kharbeche, M. (2013). An assignment-based lower bound for a class of two-machine flow shop problems. Computers & Operations Research, 40(7), 1693-1699.
Hoogeveen, J., & Velde, S. v. d. (1995). Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Operations Research Letters, 205-208.
Johnson, S. M. (1954). Optimal two‐and three‐stage production schedules with setup times included. Naval research Logistics Quarterly, 1(1), 61-68.
Józefowska, J., Jurisch, B., & Kubiak, W. (1994). Scheduling shops to minimize the weighted number of late jobs. Operations Research Letters, 16(5), 277-283.
Kellerer, H., & Strusevich, V. A. (2010). Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica, 57(4), 769-795.
Kharbeche, M., & Haouari, M. (2012). MIP models for minimizing total tardiness in a two-machine flow shop. Journal of the Operational Research Society, 64(5), 690-707.
Kim, Y.-D. (1993). A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops. Computers & Operations Research, 20(4), 391-401.
Lee, W.-C., Chen, S.-K., Chen, C.-W., & Wu, C.-C. (2011). A two-machine flowshop problem with two agents. Computers & Operations Research, 38(1), 98-104. doi:10.1016/j.cor.2010.04.002
Lee, W.-C., Chen, S.-k., & Wu, C.-C. (2010). Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem. Expert Systems with Applications, 37(9), 6594-6601.
Lei, D. (2015). Variable neighborhood search for two-agent flow shop scheduling problem. Computers & Industrial Engineering, 80, 125-131. doi:http://dx.doi.org/10.1016/j.cie.2014.11.024
Lenstra, J. K., Kan, A. R., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343-362.
Leung, J. Y. T., Pinedo, M., & Wan, G. (2010). Competitive Two-Agent Scheduling and Its Applications. Operations Research, 58(2), 458-469. doi:10.2307/40605929
Liu, P., Yi, N., Zhou, X., & Gong, H. (2013). Scheduling two agents with sum-of-processing-times-based deterioration on a single machine. Applied Mathematics and Computation, 219(17), 8848-8855.
Luo, W., Chen, L., & Zhang, G. (2012). Approximation schemes for two-machine flow shop scheduling with two agents. Journal of Combinatorial Optimization, 24(3), 229-239.
M’Hallah, R. (2014). Minimizing total earliness and tardiness on a permutation flow shop using VNS and MIP. Computers & Industrial Engineering, 75, 142-156.
Pan, J. C.-H., Chen, J.-S., & Chao, C.-M. (2002). Minimizing tardiness in a two-machine flow-shop. Computers & Operations Research, 29(7), 869-885.
Pan, J. C.-H., & Fan, E.-T. (1997). Two-machine flowshop scheduling to minimize total tardiness. International Journal of Systems Science, 28(4), 405-414.
Perez-Gonzalez, P., & Framinan, J. M. (2014). A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems. European Journal of Operational Research, 235(1), 1-16. Pinedo, M. (2002). Scheduling-Theory, Algorithms, and Analysis. New Jersey: Prentice-Hall.
Schaller, J. (2005). Note on minimizing total tardiness in a two-machine flowshop. Computers & Operations Research, 32(12), 3273-3281.
Sen, T., Dileepan, P., & Gupia, J. N. (1989). The two-machine flowshop scheduling problem with total tardiness. Computers & Operations Research, 16(4), 333-340.
Shiau, Y.-R., Tsai, M.-S., Lee, W.-C., & Cheng, T. C. E. (2015). Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time. Computers & Industrial Engineering, 87, 580-589.
Wu, C.-C., Huang, S.-K., & Lee, W.-C. (2011). Two-agent scheduling with learning consideration. Computers & Industrial Engineering, 61(4), 1324-1335.
Wu, W.-H. (2014). Solving a two-agent single-machine learning scheduling problem. International Journal of Computer Integrated Manufacturing, 27(1), 20-35.
Wu, W.-H., Xu, J., Wu, W.-H., Yin, Y., Cheng, I. F., & Wu, C.-C. (2013). A tabu method for a two-agent single-machine scheduling with deterioration jobs. Computers & Operations Research, 40(8), 2116-2127. doi:10.1016/j.cor.2013.02.025
Yin, Y., Cheng, S.-R., & Wu, C.-C. (2012a). Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties. Information Sciences, 189, 282-292. doi:10.1016/j.ins.2011.11.035
Yin, Y., Wu, W.-H., Cheng, S.-R., & Wu, C.-C. (2012b). An investigation on a two-agent single-machine scheduling problem with unequal release dates. Computers & Operations Research, 39(12), 3062-3073.