American Institue of Mathematical Sciences

2017, 2(1): 39-58. doi: 10.3934/bdia.2017007

A moving block sequence-based evolutionary algorithm for resource investment project scheduling problems

 Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education Xidian University Xi'an 710071, China

* Corresponding author: Jing Liu

Published  September 2017

Inspired by the representation designed for floorplanning problems, in this paper, we proposed a new representation, namely the moving block sequence (MBS), for resource investment project scheduling problems (RIPSPs). Since each activity of a project in RIPSPs has fixed duration and resource demand, we consider an activity as a rectangle block whose width is equal to the duration of the activity and height the resource needed by the activity. Four move modes are designed for activities, by using which the activity can move to the appropriate position. Therefore, the new representation of the project of RIPSPs consists of two parts: an activity list and a move mode list. By initializing the move modes randomly for each activity and moving it appropriately, the activity list can be decoded into valid solutions of RIPSPs. Since the decoding method of MBS guarantees that after moved, each activity is scheduled in the left-most and bottom-most position within a coordinate, which means that each activity in the corresponding project is arranged as early as possible when the precedence constraints and resource demands are satisfied. In addition, the multiagent evolutionary algorithm (MAEA) is employed to incorporate with the newly designed MBS representation in solving RIPSPs. With the intrinsic properties of MBS in mind, four behaviors, namely the crossover, mutation, competition, and self-learning operators are designed for agents in MAEA. To test the performance of our algorithm, 450 problem instances are used and the experimental results demonstrate the good performance of the proposed representation.

Citation: Xiaoxiao Yuan, Jing Liu, Xingxing Hao. A moving block sequence-based evolutionary algorithm for resource investment project scheduling problems. Big Data & Information Analytics, 2017, 2 (1) : 39-58. doi: 10.3934/bdia.2017007
References:
 [1] H. A. Abbass, A. Bender, H. Dam, S. Baker, J. M. Whitacre, R. A. Sarker, Computational scenario-based capability planning, in Genetic and Evolutionary Computation Conference (GECCO), ACM, Atlanta, Georgia, (2008), 1437-1444. doi: 10.1145/1389095.1389378. [2] P. Brucker, A. Drexl, R. Möhring, K. Neumann, E. Pesch, Resource-constrained project scheduling: Notation, classification, models, and methods, European Journal of Operational Research, 112 (1999), 3-41. doi: 10.1016/S0377-2217(98)00204-5. [3] L. T. Bui, M. Barlow, H. A. Abbass, A multi-objective risk-based framework for mission capability planning, New Mathematics and Natural Computation, 5 (2009), 459-485. doi: 10.1142/S1793005709001428. [4] F. Chicano, F. Luna, A. J. Nebro, E. Alba, Using multi-objective metaheuristics to solve the software project scheduling problem, in GECCO'11 Proceedings of the 13th annual conference on Genetic and evolutionary computation, ACM, Dublin, Ireland, (2011), 1915-1922. doi: 10.1145/2001576.2001833. [5] S.-H. Cho, S. D. Eppinger, A simulation-based process model for managing complex design projects, IEEE Trans. Engineering Management, 52 (2005), 316-328. doi: 10.1109/TEM.2005.850722. [6] D. Debels, B. D. Reyck, R. Leus, M. Vanhoucke, A hybrid scatter search/electromagnetism meta-heuristic for project scheduling, European Journal of Operational Research, 169 (2006), 638-653, Feature Cluster on Scatter Search Methods for Optimization. doi: 10.1016/j.ejor.2004.08.020. [7] E. Demeulemeester, Minimizing resource availability costs in time-limited project networks, Management Science, 41 (1995), 1590-1598. doi: 10.1287/mnsc.41.10.1590. [8] B. Depenbrock, T. Balint, J. Sheehy, Leveraging design principles to optimize technology portfolio prioritization, in 2015 IEEE Aerospace Conference, (2015), 1-10. doi: 10.1109/AERO.2015.7119203. [9] A. Drexl, A. Kimms, Optimization guided lower and upper bounds for the resource investment problem, The Journal of the Operational Research Society, 52 (2001), 340-351. doi: 10.1057/palgrave.jors.2601099. [10] K. S. Hindi, H. Yang, K. Fleszar, An evolutionary algorithm for resource-constrained project scheduling, IEEE Transactions on Evolutionary Computation, 6 (2002), 512-518. doi: 10.1109/TEVC.2002.804914. [11] R. Kolisch, Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation, European Journal of Operational Research, 90 (1996), 320-333. doi: 10.1016/0377-2217(95)00357-6. [12] R. Kolisch, S. Hartmann, Heuristic algorithms for the resource-constrained project scheduling problem: Classification and computational analysis, Project Scheduling, (1999), 147-178. doi: 10.1007/978-1-4615-5533-9_7. [13] R. Kolisch, S. Hartmann, Experimental investigation of heuristics for resource-constrained project scheduling: An update, European Journal of Operational Research, 174 (2006), 23-37. doi: 10.1016/j.ejor.2005.01.065. [14] R. Kolisch, A. Sprecher, A. Drexl, Characterization and generation of a general class of resource-constrained project scheduling problems, Management Science, 41 (1995), 1693-1703. doi: 10.1287/mnsc.41.10.1693. [15] J. Liu, W. Zhong, L. Jiao, A multiagent evolutionary algorithm for combinatorial optimization problems, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 40 (2010), 229-240. [16] J. Liu, W. Zhong, L. Jiao, X. Li, Moving block sequence and organizational evolutionary algorithm for general floorplanning with arbitrarily shaped rectilinear blocks, IEEE Transactions on Evolutionary Computation, 12 (2008), 630-646. [17] J. Liu, W. Zhong, L. Jiao, A multiagent evolutionary algorithm for constraint satisfaction problems, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 36 (2006), 54-73. [18] L. L. Minku, D. Sudholt, X. Yao, Evolutionary algorithms for the project scheduling problem: runtime analysis and improved design, in GECCO'12 Proceedings of the 14th annual conference on Genetic and evolutionary computation, ACM, Philadelphia, Pennsylvania USA, (2012), 1221-1228. doi: 10.1145/2330163.2330332. [19] R. H. Möhring, Minimizing costs of resource requirements in project networks subject to a fixed completion time, Operational Research, 32 (1984), 89-120. [20] H. Nübel, The resource renting problem subject to temporal constraints, OR-Spektrum, 23 (2001), 359-381. doi: 10.1007/PL00013357. [21] C. Qian, Y. Yu and Z. -H. Zhou, Variable solution structure can be helpful in evolutionary optimization Science China Information Sciences, 58 (2015), 112105, 17 pp. [22] B. D. Reyck, R. Leus, R&d project scheduling when activities may fail, IIE Transactions, 40 (2008), 367-384. doi: 10.1080/07408170701413944. [23] S. R. Schultz, J. Atzmon, A simulation based heuristic approach to a resource investment problem (rip), in Proceedings of the Winter Simulation Conference, (2014), 3411-3422. doi: 10.1109/WSC.2014.7020174. [24] S. Shadrokh, F. Kianfar, A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty, European Journal of Operational Research, 181 (2007), 86-101. doi: 10.1016/j.ejor.2006.03.056. [25] J. Xiong, J. Liu, Y. Chen, H. A. Abbass, A knowledge-based evolutionary multiobjective approach for stochastic extended resource investment project scheduling problems, IEEE Transactions on Evolutionary Computation, 18 (2014), 742-763. [26] J. Xiong, K. wei Yang, J. Liu, Q. song Zhao, Y.wu. Chen, A two-stage preference-based evolutionary multi-objective approach for capability planning problems, Knowledge-Based Systems, 31 (2012), 128-139. doi: 10.1016/j.knosys.2012.02.003. [27] W. Zhong, J. Liu, M. Xue, L. Jiao, A multiagent genetic algorithm for global numerical optimization, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 34 (2004), 1128-1141.

show all references

References:
 [1] H. A. Abbass, A. Bender, H. Dam, S. Baker, J. M. Whitacre, R. A. Sarker, Computational scenario-based capability planning, in Genetic and Evolutionary Computation Conference (GECCO), ACM, Atlanta, Georgia, (2008), 1437-1444. doi: 10.1145/1389095.1389378. [2] P. Brucker, A. Drexl, R. Möhring, K. Neumann, E. Pesch, Resource-constrained project scheduling: Notation, classification, models, and methods, European Journal of Operational Research, 112 (1999), 3-41. doi: 10.1016/S0377-2217(98)00204-5. [3] L. T. Bui, M. Barlow, H. A. Abbass, A multi-objective risk-based framework for mission capability planning, New Mathematics and Natural Computation, 5 (2009), 459-485. doi: 10.1142/S1793005709001428. [4] F. Chicano, F. Luna, A. J. Nebro, E. Alba, Using multi-objective metaheuristics to solve the software project scheduling problem, in GECCO'11 Proceedings of the 13th annual conference on Genetic and evolutionary computation, ACM, Dublin, Ireland, (2011), 1915-1922. doi: 10.1145/2001576.2001833. [5] S.-H. Cho, S. D. Eppinger, A simulation-based process model for managing complex design projects, IEEE Trans. Engineering Management, 52 (2005), 316-328. doi: 10.1109/TEM.2005.850722. [6] D. Debels, B. D. Reyck, R. Leus, M. Vanhoucke, A hybrid scatter search/electromagnetism meta-heuristic for project scheduling, European Journal of Operational Research, 169 (2006), 638-653, Feature Cluster on Scatter Search Methods for Optimization. doi: 10.1016/j.ejor.2004.08.020. [7] E. Demeulemeester, Minimizing resource availability costs in time-limited project networks, Management Science, 41 (1995), 1590-1598. doi: 10.1287/mnsc.41.10.1590. [8] B. Depenbrock, T. Balint, J. Sheehy, Leveraging design principles to optimize technology portfolio prioritization, in 2015 IEEE Aerospace Conference, (2015), 1-10. doi: 10.1109/AERO.2015.7119203. [9] A. Drexl, A. Kimms, Optimization guided lower and upper bounds for the resource investment problem, The Journal of the Operational Research Society, 52 (2001), 340-351. doi: 10.1057/palgrave.jors.2601099. [10] K. S. Hindi, H. Yang, K. Fleszar, An evolutionary algorithm for resource-constrained project scheduling, IEEE Transactions on Evolutionary Computation, 6 (2002), 512-518. doi: 10.1109/TEVC.2002.804914. [11] R. Kolisch, Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation, European Journal of Operational Research, 90 (1996), 320-333. doi: 10.1016/0377-2217(95)00357-6. [12] R. Kolisch, S. Hartmann, Heuristic algorithms for the resource-constrained project scheduling problem: Classification and computational analysis, Project Scheduling, (1999), 147-178. doi: 10.1007/978-1-4615-5533-9_7. [13] R. Kolisch, S. Hartmann, Experimental investigation of heuristics for resource-constrained project scheduling: An update, European Journal of Operational Research, 174 (2006), 23-37. doi: 10.1016/j.ejor.2005.01.065. [14] R. Kolisch, A. Sprecher, A. Drexl, Characterization and generation of a general class of resource-constrained project scheduling problems, Management Science, 41 (1995), 1693-1703. doi: 10.1287/mnsc.41.10.1693. [15] J. Liu, W. Zhong, L. Jiao, A multiagent evolutionary algorithm for combinatorial optimization problems, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 40 (2010), 229-240. [16] J. Liu, W. Zhong, L. Jiao, X. Li, Moving block sequence and organizational evolutionary algorithm for general floorplanning with arbitrarily shaped rectilinear blocks, IEEE Transactions on Evolutionary Computation, 12 (2008), 630-646. [17] J. Liu, W. Zhong, L. Jiao, A multiagent evolutionary algorithm for constraint satisfaction problems, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 36 (2006), 54-73. [18] L. L. Minku, D. Sudholt, X. Yao, Evolutionary algorithms for the project scheduling problem: runtime analysis and improved design, in GECCO'12 Proceedings of the 14th annual conference on Genetic and evolutionary computation, ACM, Philadelphia, Pennsylvania USA, (2012), 1221-1228. doi: 10.1145/2330163.2330332. [19] R. H. Möhring, Minimizing costs of resource requirements in project networks subject to a fixed completion time, Operational Research, 32 (1984), 89-120. [20] H. Nübel, The resource renting problem subject to temporal constraints, OR-Spektrum, 23 (2001), 359-381. doi: 10.1007/PL00013357. [21] C. Qian, Y. Yu and Z. -H. Zhou, Variable solution structure can be helpful in evolutionary optimization Science China Information Sciences, 58 (2015), 112105, 17 pp. [22] B. D. Reyck, R. Leus, R&d project scheduling when activities may fail, IIE Transactions, 40 (2008), 367-384. doi: 10.1080/07408170701413944. [23] S. R. Schultz, J. Atzmon, A simulation based heuristic approach to a resource investment problem (rip), in Proceedings of the Winter Simulation Conference, (2014), 3411-3422. doi: 10.1109/WSC.2014.7020174. [24] S. Shadrokh, F. Kianfar, A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty, European Journal of Operational Research, 181 (2007), 86-101. doi: 10.1016/j.ejor.2006.03.056. [25] J. Xiong, J. Liu, Y. Chen, H. A. Abbass, A knowledge-based evolutionary multiobjective approach for stochastic extended resource investment project scheduling problems, IEEE Transactions on Evolutionary Computation, 18 (2014), 742-763. [26] J. Xiong, K. wei Yang, J. Liu, Q. song Zhao, Y.wu. Chen, A two-stage preference-based evolutionary multi-objective approach for capability planning problems, Knowledge-Based Systems, 31 (2012), 128-139. doi: 10.1016/j.knosys.2012.02.003. [27] W. Zhong, J. Liu, M. Xue, L. Jiao, A multiagent genetic algorithm for global numerical optimization, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 34 (2004), 1128-1141.
An example of precedence graph
An example of precedence graph
The types of overlaps. (a) All kinds of top-overlaps, (b) all kinds of right-overlaps
Relative positions of $CoverLeftX$ and $CoverRightX$. (a) and (b) are the cases without violating precedence constraints. (c) and (d) are the cases violating precedence constraints
The decoding process
The agent lattice of MBS$_{\rm {MAEA}}$-RIPSP
The Percentages of Finding Optimal Solutions for MBS$_{\rm MAEA}$-RIPSP on Möhring Instances with 1000 Evaluations
 $C_1/C_2/C_3/C_4$ $\theta = 1.0$ $\theta = 1.1$ $\theta = 1.2$ $\theta = 1.3$ $\theta = 1.4$ $\theta = 1.5$ 1/1/1/1 1.00 1.00 1.00 1.00 0.067 0.033 3/1/1/1 1.00 0.90 0.90 0.80 0.133 0.067 1/3/1/1 1.00 1.00 1.00 0.80 0.700 0.333 1/1/3/1 1.00 1.00 1.00 1.00 0.950 0.067 1/1/1/3 1.00 1.00 1.00 0.60 1.00 0.067 3/3/1/1 1.00 0.50 0.80 0.80 0.00 0.333 3/1/3/1 1.00 1.00 0.90 0.85 0.60 0.333 3/1/1/3 1.00 0.75 0.95 0.75 0.533 0.067 1/3/3/1 1.00 1.00 1.00 1.00 0.70 0.033 1/3/1/3 1.00 1.00 1.00 1.00 0.80 0.00 1/1/3/3 1.00 1.00 1.00 1.00 0.60 0.00 3/3/3/1 1.00 1.00 0.90 1.00 0.333 0.20 3/3/1/3 1.00 0.45 1.00 0.75 0.133 0.033 3/1/3/3 1.00 1.00 0.95 0.85 0.167 0.067 1/3/3/3 1.00 1.00 1.00 1.00 0.70 0.067
 $C_1/C_2/C_3/C_4$ $\theta = 1.0$ $\theta = 1.1$ $\theta = 1.2$ $\theta = 1.3$ $\theta = 1.4$ $\theta = 1.5$ 1/1/1/1 1.00 1.00 1.00 1.00 0.067 0.033 3/1/1/1 1.00 0.90 0.90 0.80 0.133 0.067 1/3/1/1 1.00 1.00 1.00 0.80 0.700 0.333 1/1/3/1 1.00 1.00 1.00 1.00 0.950 0.067 1/1/1/3 1.00 1.00 1.00 0.60 1.00 0.067 3/3/1/1 1.00 0.50 0.80 0.80 0.00 0.333 3/1/3/1 1.00 1.00 0.90 0.85 0.60 0.333 3/1/1/3 1.00 0.75 0.95 0.75 0.533 0.067 1/3/3/1 1.00 1.00 1.00 1.00 0.70 0.033 1/3/1/3 1.00 1.00 1.00 1.00 0.80 0.00 1/1/3/3 1.00 1.00 1.00 1.00 0.60 0.00 3/3/3/1 1.00 1.00 0.90 1.00 0.333 0.20 3/3/1/3 1.00 0.45 1.00 0.75 0.133 0.033 3/1/3/3 1.00 1.00 0.95 0.85 0.167 0.067 1/3/3/3 1.00 1.00 1.00 1.00 0.70 0.067
The Comparison of Numbers of Generation to Reach to the Optimal Solutions between MBS$_{\rm MAEA}$-RIPSP and GA for Möhring Test Sets
 $C_1/C_2/C_3/C_4$ $\theta = 1.0$ $\theta = 1.1$ $\theta = 1.2$ $\theta = 1.3$ $\theta = 1.4$ $\theta = 1.5$ MBS GA MBS GA MBS GA MBS GA MBS GA MBS GA 1/1/1/1 1 1 1 2 1 1 1 6 6 21 14 1 3/1/1/1 1 1 6 1 1 2 1 2 7 20 27 1 1/3/1/1 1 2 1 33 1 4 1 1 2 43 13 1 1/1/3/1 1 1 1 1 1 1 1 1 1 23 4 3 1/1/1/3 1 1 1 1 1 3 2 1 12 1 4 5 3/3/1/1 1 1 1 28 1 2 1 2 5 1 7 1 3/1/3/1 1 1 1 1 1 2 1 1 8 11 8 9 3/1/1/3 1 2 1 2 1 6 2 1 9 8 10 2 1/3/3/1 1 1 1 1 1 8 2 1 1 15 2 3 1/3/1/3 1 1 1 2 1 1 1 1 8 6 20 1 1/1/3/3 1 3 1 3 1 2 1 2 5 37 12 1 3/3/3/1 1 1 1 2 1 2 1 2 9 14 13 1 3/3/1/3 1 1 4 1 1 1 3 2 8 8 22 1 3/1/3/3 1 2 1 21 1 1 2 1 31 18 4 5 1/3/3/3 1 2 1 2 1 3 3 1 19 3 49 23
 $C_1/C_2/C_3/C_4$ $\theta = 1.0$ $\theta = 1.1$ $\theta = 1.2$ $\theta = 1.3$ $\theta = 1.4$ $\theta = 1.5$ MBS GA MBS GA MBS GA MBS GA MBS GA MBS GA 1/1/1/1 1 1 1 2 1 1 1 6 6 21 14 1 3/1/1/1 1 1 6 1 1 2 1 2 7 20 27 1 1/3/1/1 1 2 1 33 1 4 1 1 2 43 13 1 1/1/3/1 1 1 1 1 1 1 1 1 1 23 4 3 1/1/1/3 1 1 1 1 1 3 2 1 12 1 4 5 3/3/1/1 1 1 1 28 1 2 1 2 5 1 7 1 3/1/3/1 1 1 1 1 1 2 1 1 8 11 8 9 3/1/1/3 1 2 1 2 1 6 2 1 9 8 10 2 1/3/3/1 1 1 1 1 1 8 2 1 1 15 2 3 1/3/1/3 1 1 1 2 1 1 1 1 8 6 20 1 1/1/3/3 1 3 1 3 1 2 1 2 5 37 12 1 3/3/3/1 1 1 1 2 1 2 1 2 9 14 13 1 3/3/1/3 1 1 4 1 1 1 3 2 8 8 22 1 3/1/3/3 1 2 1 21 1 1 2 1 31 18 4 5 1/3/3/3 1 2 1 2 1 3 3 1 19 3 49 23
Parameter Settings for J10, J14 and J20 Test Sets
 Test Set #Agent MaxGen ExcuteNum $SelfLTime$ $P_{cro}$ $P_{mut}$ $P_{com}$ J10 $20\times 20$ 10 10 12 0.95 0.85 0.9 J14 $20\times 20$ 10 8 12 0.95 0.85 1.0 J20 $20\times 19$ 10 8 12 0.95 0.85 1.0
 Test Set #Agent MaxGen ExcuteNum $SelfLTime$ $P_{cro}$ $P_{mut}$ $P_{com}$ J10 $20\times 20$ 10 10 12 0.95 0.85 0.9 J14 $20\times 20$ 10 8 12 0.95 0.85 1.0 J20 $20\times 19$ 10 8 12 0.95 0.85 1.0
Experimental Results of MBS$_{\rm MAEA}$-RIPSP for J10, J14 and J20 Test Sets
 $\theta$ J10 J14 J20 Opt.% Dev.% Eva. Opt.% Dev.% Eva. Opt.% Dev.% Eva. 1.0 40.0 6.8896 6988 76.5 0.7970 3719 32.5 4.9126 7135 1.1 41.0 3.4006 7225 63.0 1.0457 4981 35.0 5.4335 7327 1.2 55.0 2.5922 5821 43.125 2.5851 7683 33.0 4.9258 7273 1.3 51.5 2.4822 6170 49.375 2.2975 7369 43.0 2.6173 7188 1.4 56.0 2.8036 6065 47.5 1.9321 6771 43.0 2.0079 7279 1.5 68.5 1.8743 4496 55.0 1.8272 7465 43.0 1.9728 7154
 $\theta$ J10 J14 J20 Opt.% Dev.% Eva. Opt.% Dev.% Eva. Opt.% Dev.% Eva. 1.0 40.0 6.8896 6988 76.5 0.7970 3719 32.5 4.9126 7135 1.1 41.0 3.4006 7225 63.0 1.0457 4981 35.0 5.4335 7327 1.2 55.0 2.5922 5821 43.125 2.5851 7683 33.0 4.9258 7273 1.3 51.5 2.4822 6170 49.375 2.2975 7369 43.0 2.6173 7188 1.4 56.0 2.8036 6065 47.5 1.9321 6771 43.0 2.0079 7279 1.5 68.5 1.8743 4496 55.0 1.8272 7465 43.0 1.9728 7154
Comparisons between MBS$_{\rm MAEA}$-RIPSP and GA for J10, J14 and J20 Test Sets
 Test Set Opt.% Dev.% MBS GA MBS GA J10 52.00 48.20 3.3404 0.23 J14 55.75 40.00 1.7474 0.32 J20 38.25 33.33 3.6445 4.68
 Test Set Opt.% Dev.% MBS GA MBS GA J10 52.00 48.20 3.3404 0.23 J14 55.75 40.00 1.7474 0.32 J20 38.25 33.33 3.6445 4.68
 [1] Zhe Zhang, Jiuping Xu. Bi-level multiple mode resource-constrained project scheduling problems under hybrid uncertainty. Journal of Industrial & Management Optimization, 2016, 12 (2) : 565-593. doi: 10.3934/jimo.2016.12.565 [2] Jian Xiong, Yingwu Chen, Zhongbao Zhou. Resilience analysis for project scheduling with renewable resource constraint and uncertain activity durations. Journal of Industrial & Management Optimization, 2016, 12 (2) : 719-737. doi: 10.3934/jimo.2016.12.719 [3] Ming Yang, Chulin Li. Valuing investment project in competitive environment. Conference Publications, 2003, 2003 (Special) : 945-950. doi: 10.3934/proc.2003.2003.945 [4] Jiping Tao, Ronghuan Huang, Tundong Liu. A $2.28$-competitive algorithm for online scheduling on identical machines. Journal of Industrial & Management Optimization, 2015, 11 (1) : 185-198. doi: 10.3934/jimo.2015.11.185 [5] Alexander Zeh, Antonia Wachter. Fast multi-sequence shift-register synthesis with the Euclidean algorithm. Advances in Mathematics of Communications, 2011, 5 (4) : 667-680. doi: 10.3934/amc.2011.5.667 [6] Yunqiang Yin, T. C. E. Cheng, Jianyou Xu, Shuenn-Ren Cheng, Chin-Chia Wu. Single-machine scheduling with past-sequence-dependent delivery times and a linear deterioration. Journal of Industrial & Management Optimization, 2013, 9 (2) : 323-339. doi: 10.3934/jimo.2013.9.323 [7] Didem Cinar, José António Oliveira, Y. Ilker Topcu, Panos M. Pardalos. A priority-based genetic algorithm for a flexible job shop scheduling problem. Journal of Industrial & Management Optimization, 2016, 12 (4) : 1391-1415. doi: 10.3934/jimo.2016.12.1391 [8] Tohru Wakasa, Shoji Yotsutani. Representation formulas for some 1-dimensional linearized eigenvalue problems. Communications on Pure & Applied Analysis, 2008, 7 (4) : 745-763. doi: 10.3934/cpaa.2008.7.745 [9] Lalida Deeratanasrikul, Shinji Mizuno. Multiple-stage multiple-machine capacitated lot-sizing and scheduling with sequence-dependent setup: A case study in the wheel industry. Journal of Industrial & Management Optimization, 2017, 13 (1) : 413-428. doi: 10.3934/jimo.2016024 [10] Guanghui Zhou, Qin Ni, Meilan Zeng. A scaled conjugate gradient method with moving asymptotes for unconstrained optimization problems. Journal of Industrial & Management Optimization, 2017, 13 (2) : 595-608. doi: 10.3934/jimo.2016034 [11] Jiping Tao, Zhijun Chao, Yugeng Xi. A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times. Journal of Industrial & Management Optimization, 2010, 6 (2) : 269-282. doi: 10.3934/jimo.2010.6.269 [12] Y. K. Lin, C. S. Chong. A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem. Journal of Industrial & Management Optimization, 2016, 12 (2) : 703-717. doi: 10.3934/jimo.2016.12.703 [13] Le Thi Hoai An, Tran Duc Quynh, Kondo Hloindo Adjallah. A difference of convex functions algorithm for optimal scheduling and real-time assignment of preventive maintenance jobs on parallel processors. Journal of Industrial & Management Optimization, 2014, 10 (1) : 243-258. doi: 10.3934/jimo.2014.10.243 [14] Ling Lin, Dong He, Zhiyi Tan. Bounds on delay start LPT algorithm for scheduling on two identical machines in the $l_p$ norm. Journal of Industrial & Management Optimization, 2008, 4 (4) : 817-826. doi: 10.3934/jimo.2008.4.817 [15] Ran Ma, Jiping Tao. An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time. Journal of Industrial & Management Optimization, 2017, 13 (4) : 1-14. doi: 10.3934/jimo.2017057 [16] Lacramioara Grecu, Constantin Popa. Constrained SART algorithm for inverse problems in image reconstruction. Inverse Problems & Imaging, 2013, 7 (1) : 199-216. doi: 10.3934/ipi.2013.7.199 [17] Ram U. Verma. On the generalized proximal point algorithm with applications to inclusion problems. Journal of Industrial & Management Optimization, 2009, 5 (2) : 381-390. doi: 10.3934/jimo.2009.5.381 [18] Giovanni Russo, Francis Filbet. Semilagrangian schemes applied to moving boundary problems for the BGK model of rarefied gas dynamics. Kinetic & Related Models, 2009, 2 (1) : 231-250. doi: 10.3934/krm.2009.2.231 [19] Yi Shi, Kai Bao, Xiao-Ping Wang. 3D adaptive finite element method for a phase field model for the moving contact line problems. Inverse Problems & Imaging, 2013, 7 (3) : 947-959. doi: 10.3934/ipi.2013.7.947 [20] Artyom Nahapetyan, Panos M. Pardalos. A bilinear relaxation based algorithm for concave piecewise linear network flow problems. Journal of Industrial & Management Optimization, 2007, 3 (1) : 71-85. doi: 10.3934/jimo.2007.3.71

Impact Factor: