104 research outputs found
Mode-Based versus Activity-Based Search for a Nonredundant Resolution of the Multimode Resource-Constrained Project Scheduling Problem
[EN] This paper addresses an energy-based extension of the Multimode Resource-Constrained Project Scheduling Problem (MRCPSP) called MRCPSP-ENERGY. This extension considers the energy consumption as an additional resource that leads to different execution modes (and durations) of the activities. Consequently, different schedules can be obtained. The objective is to maximize the efficiency of the project, which takes into account the minimization of both makespan and energy consumption. This is a well-known NP-hard problem, such that the application of metaheuristic techniques is necessary to address real-size problems in a reasonable time. This paper shows that the Activity List representation, commonly used in metaheuristics, can lead to obtaining many redundant solutions, that is, solutions that have different representations but are in fact the same. This is a serious disadvantage for a search procedure. We propose a genetic algorithm(GA) for solving the MRCPSP-ENERGY, trying to avoid redundant solutions by focusing the search on the execution modes, by using the Mode List representation. The proposed GA is evaluated on different instances of the PSPLIB-ENERGY library and compared to the results obtained by both exact methods and approximate methods reported in the literature. This library is an extension of the well-known PSPLIB library, which contains MRCPSP-ENERGY test cases.This paper has been partially supported by the Spanish Research Projects TIN2013-46511-C2-1-P and TIN2016-80856-R.Morillo-Torres, D.; Barber, F.; Salido, MA. (2017). Mode-Based versus Activity-Based Search for a Nonredundant Resolution of the Multimode Resource-Constrained Project Scheduling Problem. Mathematical Problems in Engineering. 2017:1-15. https://doi.org/10.1155/2017/4627856S1152017Mouzon, G., Yildirim, M. B., & Twomey, J. (2007). Operational methods for minimization of energy consumption of manufacturing equipment. International Journal of Production Research, 45(18-19), 4247-4271. doi:10.1080/00207540701450013Hartmann, S., & Sprecher, A. (1996). A note on «hierarchical models for multi-project planning and scheduling». European Journal of Operational Research, 94(2), 377-383. doi:10.1016/0377-2217(95)00158-1Christofides, N., Alvarez-Valdes, R., & Tamarit, J. M. (1987). Project scheduling with resource constraints: A branch and bound approach. European Journal of Operational Research, 29(3), 262-273. doi:10.1016/0377-2217(87)90240-2Zhu, G., Bard, J. F., & Yu, G. (2006). A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem. INFORMS Journal on Computing, 18(3), 377-390. doi:10.1287/ijoc.1040.0121Kolisch, R., & Hartmann, S. (1999). Heuristic Algorithms for the Resource-Constrained Project Scheduling Problem: Classification and Computational Analysis. International Series in Operations Research & Management Science, 147-178. doi:10.1007/978-1-4615-5533-9_7Józefowska, J., Mika, M., Różycki, R., Waligóra, G., & Węglarz, J. (2001). Annals of Operations Research, 102(1/4), 137-155. doi:10.1023/a:1010954031930Bouleimen, K., & Lecocq, H. (2003). A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. European Journal of Operational Research, 149(2), 268-281. doi:10.1016/s0377-2217(02)00761-0Alcaraz, J., Maroto, C., & Ruiz, R. (2003). Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms. Journal of the Operational Research Society, 54(6), 614-626. doi:10.1057/palgrave.jors.2601563Zhang, H., Tam, C. M., & Li, H. (2006). Multimode Project Scheduling Based on Particle Swarm Optimization. Computer-Aided Civil and Infrastructure Engineering, 21(2), 93-103. doi:10.1111/j.1467-8667.2005.00420.xJarboui, B., Damak, N., Siarry, P., & Rebai, A. (2008). A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Applied Mathematics and Computation, 195(1), 299-308. doi:10.1016/j.amc.2007.04.096Li, H., & Zhang, H. (2013). Ant colony optimization-based multi-mode scheduling under renewable and nonrenewable resource constraints. Automation in Construction, 35, 431-438. doi:10.1016/j.autcon.2013.05.030Lova, A., Tormos, P., Cervantes, M., & Barber, F. (2009). An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes. International Journal of Production Economics, 117(2), 302-316. doi:10.1016/j.ijpe.2008.11.002Peteghem, V. V., & Vanhoucke, M. (2010). A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem. European Journal of Operational Research, 201(2), 409-418. doi:10.1016/j.ejor.2009.03.034Węglarz, J., Józefowska, J., Mika, M., & Waligóra, G. (2011). Project scheduling with finite or infinite number of activity processing modes – A survey. European Journal of Operational Research, 208(3), 177-205. doi:10.1016/j.ejor.2010.03.037Kolisch, R., & Hartmann, S. (2006). Experimental investigation of heuristics for resource-constrained project scheduling: An update. European Journal of Operational Research, 174(1), 23-37. doi:10.1016/j.ejor.2005.01.065Debels, D., De Reyck, B., Leus, R., & Vanhoucke, M. (2006). A hybrid scatter search/electromagnetism meta-heuristic for project scheduling. European Journal of Operational Research, 169(2), 638-653. doi:10.1016/j.ejor.2004.08.020Paraskevopoulos, D. C., Tarantilis, C. D., & Ioannou, G. (2012). Solving project scheduling problems with resource constraints via an event list-based evolutionary algorithm. Expert Systems with Applications, 39(4), 3983-3994. doi:10.1016/j.eswa.2011.09.062Drexl, A. (1991). Scheduling of Project Networks by Job Assignment. Management Science, 37(12), 1590-1602. doi:10.1287/mnsc.37.12.1590BOCTOR, F. F. (1996). Resource-constrained project scheduling by simulated annealing. International Journal of Production Research, 34(8), 2335-2351. doi:10.1080/0020754960890502
A new model and metaheuristic approach for the energy-based resource-constrained scheduling problem
[EN] This article focuses on obtaining sustainable and energy-efficient solutions for limited resource programming problems. To this end, a model for integrating makespan and energy consumption objectives in multi-mode resource-constrained project scheduling problems (MRCPSP-ENERGY) is proposed. In addition, a metaheuristic approach for the efficient resolution of these problems is developed. In order to assess the appropriateness of theses proposals, the well-known Project Scheduling Problem Library is extended (called PSPLIB-ENERGY) to include energy consumption to each Resource-Constrained Project Scheduling Problem instance through a realistic mathematical model. This extension provides an alternative to the current trend of numerous research works about optimization and the manufacturing field, which require the inclusion of components to reduce the environmental impact on the decision-making process. PSPLIB-ENERGY is available at http://gps.webs.upv.es/psplib-energy/.The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This research was supported by the Spanish Government under the research projects TIN2013-46511-C2-1 and TIN2016-80856-R.Morillo-Torres, D.; Barber, F.; Salido, MA. (2017). A new model and metaheuristic approach for the energy-based resource-constrained scheduling problem. Proceedings of the Institution of Mechanical Engineers Part B Journal of Engineering Manufacture. 1(1):1-13. https://doi.org/10.1177/0954405417711734S1131
An Enhanced Estimation of Distribution Algorithm for Energy-Efficient Job-Shop Scheduling Problems with Transportation Constraints
[EN] Nowadays, the manufacturing industry faces the challenge of reducing energy consumption and the associated environmental impacts. Production scheduling is an effective approach for energy-savings management. During the entire workshop production process, both the processing and transportation operations consume large amounts of energy. To reduce energy consumption, an energy-efficient job-shop scheduling problem (EJSP) with transportation constraints was proposed in this paper. First, a mixed-integer programming model was established to minimize both the comprehensive energy consumption and makespan in the EJSP. Then, an enhanced estimation of distribution algorithm (EEDA) was developed to solve the problem. In the proposed algorithm, an estimation of distribution algorithm was employed to perform the global search and an improved simulated annealing algorithm was designed to perform the local search. Finally, numerical experiments were implemented to analyze the performance of the EEDA. The results showed that the EEDA is a promising approach and that it can solve EJSP effectively and efficiently.This work was supported by the Natural Science Foundation of the Jiangsu Higher Education Institutions of China (No. 17KJB460018), the Innovation Foundation for Science and Technology of Yangzhou University (No. 2016CXJ020 and No. 2017CXJ018), Science and Technology Project of Yangzhou under (No. YZ2017278), Research Topics of Teaching Reform of Yangzhou University under (No. YZUJX2018-28B), and the Spanish Government (No. TIN2016-80856-R and No. TIN2015-65515-C4-1-R).Dai, M.; Zhang, Z.; Giret Boggino, AS.; Salido, MA. (2019). An Enhanced Estimation of Distribution Algorithm for Energy-Efficient Job-Shop Scheduling Problems with Transportation Constraints. Sustainability. 11(11):1-23. https://doi.org/10.3390/su11113085S1231111Wu, X., & Sun, Y. (2018). A green scheduling algorithm for flexible job shop with energy-saving measures. Journal of Cleaner Production, 172, 3249-3264. doi:10.1016/j.jclepro.2017.10.342Wang, Q., Tang, D., Li, S., Yang, J., Salido, M., Giret, A., & Zhu, H. (2019). An Optimization Approach for the Coordinated Low-Carbon Design of Product Family and Remanufactured Products. Sustainability, 11(2), 460. doi:10.3390/su11020460Meng, Y., Yang, Y., Chung, H., Lee, P.-H., & Shao, C. (2018). Enhancing Sustainability and Energy Efficiency in Smart Factories: A Review. Sustainability, 10(12), 4779. doi:10.3390/su10124779Gahm, C., Denz, F., Dirr, M., & Tuma, A. (2016). Energy-efficient scheduling in manufacturing companies: A review and research framework. European Journal of Operational Research, 248(3), 744-757. doi:10.1016/j.ejor.2015.07.017Giret, A., Trentesaux, D., & Prabhu, V. (2015). Sustainability in manufacturing operations scheduling: A state of the art review. Journal of Manufacturing Systems, 37, 126-140. doi:10.1016/j.jmsy.2015.08.002Akbar, M., & Irohara, T. (2018). Scheduling for sustainable manufacturing: A review. Journal of Cleaner Production, 205, 866-883. doi:10.1016/j.jclepro.2018.09.100Che, A., Wu, X., Peng, J., & Yan, P. (2017). Energy-efficient bi-objective single-machine scheduling with power-down mechanism. Computers & Operations Research, 85, 172-183. doi:10.1016/j.cor.2017.04.004Lee, S., Do Chung, B., Jeon, H. W., & Chang, J. (2017). A dynamic control approach for energy-efficient production scheduling on a single machine under time-varying electricity pricing. Journal of Cleaner Production, 165, 552-563. doi:10.1016/j.jclepro.2017.07.102Rubaiee, S., & Yildirim, M. B. (2019). An energy-aware multiobjective ant colony algorithm to minimize total completion time and energy cost on a single-machine preemptive scheduling. Computers & Industrial Engineering, 127, 240-252. doi:10.1016/j.cie.2018.12.020Zhang, M., Yan, J., Zhang, Y., & Yan, S. (2019). Optimization for energy-efficient flexible flow shop scheduling under time of use electricity tariffs. Procedia CIRP, 80, 251-256. doi:10.1016/j.procir.2019.01.062Li, J., Sang, H., Han, Y., Wang, C., & Gao, K. (2018). Efficient multi-objective optimization algorithm for hybrid flow shop scheduling problems with setup energy consumptions. Journal of Cleaner Production, 181, 584-598. doi:10.1016/j.jclepro.2018.02.004Lu, C., Gao, L., Li, X., Pan, Q., & Wang, Q. (2017). Energy-efficient permutation flow shop scheduling problem using a hybrid multi-objective backtracking search algorithm. Journal of Cleaner Production, 144, 228-238. doi:10.1016/j.jclepro.2017.01.011Fu, Y., Tian, G., Fathollahi-Fard, A. M., Ahmadi, A., & Zhang, C. (2019). Stochastic multi-objective modelling and optimization of an energy-conscious distributed permutation flow shop scheduling problem with the total tardiness constraint. Journal of Cleaner Production, 226, 515-525. doi:10.1016/j.jclepro.2019.04.046Schulz, S., Neufeld, J. S., & Buscher, U. (2019). A multi-objective iterated local search algorithm for comprehensive energy-aware hybrid flow shop scheduling. Journal of Cleaner Production, 224, 421-434. doi:10.1016/j.jclepro.2019.03.155Liu, Y., Dong, H., Lohse, N., Petrovic, S., & Gindy, N. (2014). An investigation into minimising total energy consumption and total weighted tardiness in job shops. Journal of Cleaner Production, 65, 87-96. doi:10.1016/j.jclepro.2013.07.060Liu, Y., Dong, H., Lohse, N., & Petrovic, S. (2016). A multi-objective genetic algorithm for optimisation of energy consumption and shop floor production performance. International Journal of Production Economics, 179, 259-272. doi:10.1016/j.ijpe.2016.06.019May, G., Stahl, B., Taisch, M., & Prabhu, V. (2015). Multi-objective genetic algorithm for energy-efficient job shop scheduling. International Journal of Production Research, 53(23), 7071-7089. doi:10.1080/00207543.2015.1005248Zhang, R., & Chiong, R. (2016). Solving the energy-efficient job shop scheduling problem: a multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption. Journal of Cleaner Production, 112, 3361-3375. doi:10.1016/j.jclepro.2015.09.097Salido, M. A., Escamilla, J., Giret, A., & Barber, F. (2015). A genetic algorithm for energy-efficiency in job-shop scheduling. The International Journal of Advanced Manufacturing Technology, 85(5-8), 1303-1314. doi:10.1007/s00170-015-7987-0Masmoudi, O., Delorme, X., & Gianessi, P. (2019). Job-shop scheduling problem with energy consideration. International Journal of Production Economics, 216, 12-22. doi:10.1016/j.ijpe.2019.03.021Mokhtari, H., & Hasani, A. (2017). An energy-efficient multi-objective optimization for flexible job-shop scheduling problem. Computers & Chemical Engineering, 104, 339-352. doi:10.1016/j.compchemeng.2017.05.004Meng, L., Zhang, C., Shao, X., & Ren, Y. (2019). MILP models for energy-aware flexible job shop scheduling problem. Journal of Cleaner Production, 210, 710-723. doi:10.1016/j.jclepro.2018.11.021Dai, M., Tang, D., Giret, A., & Salido, M. A. (2019). Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints. Robotics and Computer-Integrated Manufacturing, 59, 143-157. doi:10.1016/j.rcim.2019.04.006Lacomme, P., Larabi, M., & Tchernev, N. (2013). Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles. International Journal of Production Economics, 143(1), 24-34. doi:10.1016/j.ijpe.2010.07.012Nageswararao, M., Narayanarao, K., & Ranagajanardhana, G. (2014). Simultaneous Scheduling of Machines and AGVs in Flexible Manufacturing System with Minimization of Tardiness Criterion. Procedia Materials Science, 5, 1492-1501. doi:10.1016/j.mspro.2014.07.336Saidi-Mehrabad, M., Dehnavi-Arani, S., Evazabadian, F., & Mahmoodian, V. (2015). An Ant Colony Algorithm (ACA) for solving the new integrated model of job shop scheduling and conflict-free routing of AGVs. Computers & Industrial Engineering, 86, 2-13. doi:10.1016/j.cie.2015.01.003Guo, Z., Zhang, D., Leung, S. Y. S., & Shi, L. (2016). A bi-level evolutionary optimization approach for integrated production and transportation scheduling. Applied Soft Computing, 42, 215-228. doi:10.1016/j.asoc.2016.01.052Karimi, S., Ardalan, Z., Naderi, B., & Mohammadi, M. (2017). Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm. Applied Mathematical Modelling, 41, 667-682. doi:10.1016/j.apm.2016.09.022Liu, Z., Guo, S., & Wang, L. (2019). Integrated green scheduling optimization of flexible job shop and crane transportation considering comprehensive energy consumption. Journal of Cleaner Production, 211, 765-786. doi:10.1016/j.jclepro.2018.11.231Tang, D., & Dai, M. (2015). Energy-efficient approach to minimizing the energy consumption in an extended job-shop scheduling problem. Chinese Journal of Mechanical Engineering, 28(5), 1048-1055. doi:10.3901/cjme.2015.0617.082Hao, X., Lin, L., Gen, M., & Ohno, K. (2013). Effective Estimation of Distribution Algorithm for Stochastic Job Shop Scheduling Problem. Procedia Computer Science, 20, 102-107. doi:10.1016/j.procs.2013.09.246Wang, L., Wang, S., Xu, Y., Zhou, G., & Liu, M. (2012). A bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problem. Computers & Industrial Engineering, 62(4), 917-926. doi:10.1016/j.cie.2011.12.014Jarboui, B., Eddaly, M., & Siarry, P. (2009). An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Computers & Operations Research, 36(9), 2638-2646. doi:10.1016/j.cor.2008.11.004Hauschild, M., & Pelikan, M. (2011). An introduction and survey of estimation of distribution algorithms. Swarm and Evolutionary Computation, 1(3), 111-128. doi:10.1016/j.swevo.2011.08.003Liu, F., Xie, J., & Liu, S. (2015). A method for predicting the energy consumption of the main driving system of a machine tool in a machining process. Journal of Cleaner Production, 105, 171-177. doi:10.1016/j.jclepro.2014.09.058Dai, M., Tang, D., Giret, A., Salido, M. A., & Li, W. D. (2013). Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm. Robotics and Computer-Integrated Manufacturing, 29(5), 418-429. doi:10.1016/j.rcim.2013.04.001Beasley, J. E. (1990). OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operational Research Society, 41(11), 1069-1072. doi:10.1057/jors.1990.166Zhao, F., Shao, Z., Wang, J., & Zhang, C. (2015). A hybrid differential evolution and estimation of distribution algorithm based on neighbourhood search for job shop scheduling problems. International Journal of Production Research, 54(4), 1039-1060. doi:10.1080/00207543.2015.1041575Van Laarhoven, P. J. M., Aarts, E. H. L., & Lenstra, J. K. (1992). Job Shop Scheduling by Simulated Annealing. Operations Research, 40(1), 113-125. doi:10.1287/opre.40.1.113Wang, L., & Zheng, D.-Z. (2001). An effective hybrid optimization strategy for job-shop scheduling problems. Computers & Operations Research, 28(6), 585-596. doi:10.1016/s0305-0548(99)00137-9Dorndorf, U., & Pesch, E. (1995). Evolution based learning in a job shop scheduling environment. Computers & Operations Research, 22(1), 25-40. doi:10.1016/0305-0548(93)e0016-mPark, B. J., Choi, H. R., & Kim, H. S. (2003). A hybrid genetic algorithm for the job shop scheduling problems. Computers & Industrial Engineering, 45(4), 597-613. doi:10.1016/s0360-8352(03)00077-
A hormone regulation based approach for distributed and on-line scheduling of machines and automated guided vehicles
[EN] With the continuous innovation of technology, automated guided vehicles are playing an increasingly important role on
manufacturing systems. Both the scheduling of operations on machines as well as the scheduling of automated guided
vehicles are essential factors contributing to the efficiency of the overall manufacturing systems. In this article, a hormone
regulation¿based approach for on-line scheduling of machines and automated guided vehicles within a distributed
system is proposed. In a real-time environment, the proposed approach assigns emergent tasks and generates feasible
schedules implementing a task allocation approach based on hormonal regulation mechanism. This approach is tested on
two scheduling problems in literatures. The results from the evaluation show that the proposed approach improves the
scheduling quality compared with state-of-the-art on-line and off-line approaches.The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This research was sponsored by
the National Natural Science Foundation of China (NSFC) under grant nos 51175262 and 51575264 and the Jiangsu Province Science Foundation for Excellent Youths under grant no. BK2012032. This research was also sponsored by the CASES project which was supported by a Marie Curie International Research Staff Exchange Scheme Fellowship within the 7th European Community Framework Programme under grant agreement no. 294931.Zheng, K.; Tang, D.; Giret Boggino, AS.; Salido, MA.; Sang, Z. (2016). A hormone regulation based approach for distributed and on-line scheduling of machines and automated guided vehicles. Proceedings of the Institution of Mechanical Engineers Part B Journal of Engineering Manufacture. 232(1):99-113. https://doi.org/10.1177/0954405416662078S99113232
La revisión sistemática de la relación indirecta entre la pertenencia social frustrada y la sensación de ser una carga en el suicidio
Joiner's Interpersonal-Psychological Theory of Suicide (IPTS) considers the interpersonal variables of low social belonging and the perception of being a burden on others as drivers of suicidal ideation. This study has sought to review the empirical evidence on this prediction. In all, 40 studies were found. The findings report a major mediator and moderator role of perceived burdensomeness (PB) and thwarted belongingness (TB) in the relationship between the propensity toward suicide and psychological, social, and environmental factors. As the theory predicts, expecting to find that the interaction of both of these variables would be more closely linked to suicidal ideation, this does not appear to have been fully supported, generally finding a greater significance when they were integrated into separate models. It seems that attributing other forms of relationship with suicide for the variables identified by Joiner would provide IPTS with greater empirical support.La teoría interpersonal psicológica del suicidio de Joiner considera las variables interpersonales de baja pertenencia social y la
percepción de ser una carga para los demás como impulsores de la ideación suicida. Este estudio revisa la evidencia empírica
sobre esta predicción. En total, se han encontrado 40 estudios. Los hallazgos descubren un importante papel mediador
y moderador de la carga percibida y la pertenencia frustrada en la relación entre la propensión al suicidio y los factores
psicológicos, sociales y ambientales. Como predice la teoría, esperando encontrar que la interacción de ambas variables
estaría más estrechamente ligada a la ideación suicida, esto no parece haber sido totalmente respaldado, encontrando
generalmente una mayor significación cuando estas se integraron en modelos separados. Parece que atribuir otras formas
de relación con el suicidio para las variables identificadas por Joiner proporcionaría a la teoría interpersonal psicológica del suicidio un mayor apoyo empíric
A hybrid metaheuristic with learning for a real supply chain scheduling problem
In recent decades, research on supply chain management (SCM) has enabled companies to improve their environmental, social, and economic performance. This paper presents an industrial application of logistics that can be classified as an inventory-route problem. The problem consists of assigning orders to the available warehouses. The orders are composed of items that must be loaded within a week. The warehouses provide an inventory of the number of items available for each day of the week, so the objective is to minimize the total transportation costs and the costs of producing extra stock to satisfy the weekly demand. To solve this problem a formal mathematical model is proposed. Then a hybrid approach that involves two metaheuristics: a greedy randomized adaptive search procedure (GRASP) and a genetic algorithm (GA) is proposed. Additionally, a meta-learning tuning method is incorporated into our hybridized approach, which yields better results but with a longer computation time. Thus, the trade-off of using it is analyzed. An extensive evaluation was carried out over realistic instances provided by an industrial partner. The proposed technique was evaluated and compared with several complete and incomplete solvers from the state of the art (CP Optimizer, Yuck, OR-Tools, etc.). The results showed that our hybrid metaheuristic outperformed the behavior of these well-known solvers, mainly in large-scale instances (2000 orders per week). This hybrid algorithm provides the company with a powerful tool to solve its supply chain management problem, delivering significant economic benefits every week.The authors gratefully acknowledge the financial support of the
European Social Fund (Investing In Your Future), the Spanish Ministry
of Science (project PID2021-125919NB-I00), and valgrAI - Valencian
Graduate School and Research Network of Artificial Intelligence and
the Generalitat Valenciana, Spain, and co-funded by the European
Union. The authors also thank the industrial partner Logifruit for its
support in the problem specification and the permission to generate
randomized data for evaluating the proposed algorithm
Energy efficiency, robustness, and makespan optimality in job-shop scheduling problems
[EN] Many real-world problems are known as planning and scheduling problems, where resources must be allocated so as
to optimize overall performance objectives. The traditional scheduling models consider performance indicators such as
processing time, cost, and quality as optimization objectives. However, most of them do not take into account energy consumption
and robustness. We focus our attention in a job-shop scheduling problem where machines can work at different
speeds. It represents an extension of the classical job-shop scheduling problem, where each operation has to be executed by
one machine and this machine can work at different speeds. The main goal of the paper is focused on the analysis of three
important objectives (energy efficiency, robustness, and makespan) and the relationship among them. We present some analytical
formulas to estimate the ratio/relationship between these parameters. It can be observed that there exists a clear
relationship between robustness and energy efficiency and a clear trade-off between robustness/energy efficiency and
makespan. It represents an advance in the state of the art of production scheduling, so obtaining energy-efficient solutions
also supposes obtaining robust solutions, and vice versa.This research has been supported by the Spanish Government under research project MICINN TIN2013-46511-C2-1-P, the European CASES project (No. 294931) supported by a Marie Curie International Research Staff Exchange Scheme Fellowship within the FP7, and the European TETRACOM project (No. 609491) supported by FP7-ICT-2013-10. This research was also supported by the National Science Foundation of China (No. 51175262) and the Jiangsu Province Science Foundation for Excellent Youths under Grant BK2012032.Salido Gregorio, MA.; Escamilla Fuster, J.; Barber Sanchís, F.; Giret Boggino, AS.; Tang, D.; Dai, M. (2015). Energy efficiency, robustness, and makespan optimality in job-shop scheduling problems. AI EDAM. 30(3):300-312. https://doi.org/10.1017/S0890060415000335S300312303Billaut, J.-C., Moukrim, A., & Sanlaville, E. (Eds.). (2008). Flexibility and Robustness in Scheduling. doi:10.1002/9780470611432Nowicki, E., & Smutnicki, C. (2005). An Advanced Tabu Search Algorithm for the Job Shop Problem. Journal of Scheduling, 8(2), 145-159. doi:10.1007/s10951-005-6364-5Agnetis, A., Flamini, M., Nicosia, G., & Pacifici, A. (2010). A job-shop problem with one additional resource type. Journal of Scheduling, 14(3), 225-237. doi:10.1007/s10951-010-0162-4Mouzon, G., Yildirim, M. B., & Twomey, J. (2007). Operational methods for minimization of energy consumption of manufacturing equipment. International Journal of Production Research, 45(18-19), 4247-4271. doi:10.1080/00207540701450013Weinert, N., Chiotellis, S., & Seliger, G. (2011). Methodology for planning and operating energy-efficient production systems. CIRP Annals, 60(1), 41-44. doi:10.1016/j.cirp.2011.03.015Duflou, J. R., Sutherland, J. W., Dornfeld, D., Herrmann, C., Jeswiet, J., Kara, S., … Kellens, K. (2012). Towards energy and resource efficient manufacturing: A processes and systems approach. CIRP Annals, 61(2), 587-609. doi:10.1016/j.cirp.2012.05.002Laborie P. (2009). IBM ILOG CP Optimizer for detailed scheduling illustrated on three problems. Proc. 6th Int. Conf. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR09.Dahmus J. , & Gutowski T. (2004). An environmental analysis of machining. Proc. ASME Int. Mechanical Engineering Congr. RD&D Exposition, Anaheim, CA.Huang, K.-L., & Liao, C.-J. (2008). Ant colony optimization combined with taboo search for the job shop scheduling problem. Computers & Operations Research, 35(4), 1030-1046. doi:10.1016/j.cor.2006.07.003IBM. (2010). Modeling With IBM ILOG CP Optimizer—Practical Scheduling Examples (white paper). Armonk, NY: IBM Software Group.Kramer L. , Barbulescu L. , & Smith S. (2007). Understanding performance tradeoffs in algorithms for solving oversubscribed scheduling. Proc. 22nd Conf. Artificial Intelligence, AAAI-07, Vancouver.Seow, Y., & Rahimifard, S. (2011). A framework for modelling energy consumption within manufacturing systems. CIRP Journal of Manufacturing Science and Technology, 4(3), 258-264. doi:10.1016/j.cirpj.2011.03.007Li, W., Zein, A., Kara, S., & Herrmann, C. (2011). An Investigation into Fixed Energy Consumption of Machine Tools. Glocalized Solutions for Sustainability in Manufacturing, 268-273. doi:10.1007/978-3-642-19692-8_47Szathmáry, E. (2006). A robust approach. Nature, 439(7072), 19-20. doi:10.1038/439019aFang, K., Uhan, N., Zhao, F., & Sutherland, J. W. (2011). A new approach to scheduling in manufacturing for power consumption and carbon footprint reduction. Journal of Manufacturing Systems, 30(4), 234-240. doi:10.1016/j.jmsy.2011.08.004Gutowski, T., Murphy, C., Allen, D., Bauer, D., Bras, B., Piwonka, T., … Wolff, E. (2005). Environmentally benign manufacturing: Observations from Japan, Europe and the United States. Journal of Cleaner Production, 13(1), 1-17. doi:10.1016/j.jclepro.2003.10.004Garrido A. , Salido M.A. , Barber F. , & López M.A. (2000). Heuristic methods for solving job-shop scheduling problems. Proc. ECAI-2000 Workshop on New Results in Planning, Scheduling and Design, Berlín.Verfaillie G. , & Schiex T. (1994). Solution reuse in dynamic constraint satisfaction problems. Proc. 12th National Conf. Artificial Intelligence, AAAI-94.Dai, M., Tang, D., Giret, A., Salido, M. A., & Li, W. D. (2013). Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm. Robotics and Computer-Integrated Manufacturing, 29(5), 418-429. doi:10.1016/j.rcim.2013.04.001Neugebauer, R., Wabner, M., Rentzsch, H., & Ihlenfeldt, S. (2011). Structure principles of energy efficient machine tools. CIRP Journal of Manufacturing Science and Technology, 4(2), 136-147. doi:10.1016/j.cirpj.2011.06.017Mouzon, G., & Yildirim, M. B. (2008). A framework to minimise total energy consumption and total tardiness on a single machine. International Journal of Sustainable Engineering, 1(2), 105-116. doi:10.1080/19397030802257236Bruzzone, A. A. G., Anghinolfi, D., Paolucci, M., & Tonelli, F. (2012). Energy-aware scheduling for improving manufacturing process sustainability: A mathematical model for flexible flow shops. CIRP Annals, 61(1), 459-462. doi:10.1016/j.cirp.2012.03.08
Bi-objective optimization for low-carbon product family design
[EN] Consumers, industry, and government entities are becoming increasingly concerned about the issue of global warming. With this in mind, manufacturers have begun to develop products with consideration of low-carbon. In recent years, many companies are utilizing product families to satisfy various customer needs with lower costs. However, little research has been conducted on the development of a product family that considers environmental factors. In this paper, a low-carbon product family design that integrates environmental concerns is proposed. To this end, a new method of platform planning is investigated with considerations of cost and greenhouse gas (GHG) emission of a product family simultaneously. In this research, a lowcarbon product family design problem is described at first, and then a GHG emission model of product family is established. Furthermore, to support lowcarbon product family design, an optimization method is applied to make a significant trade-off between cost and GHG emission to implement a feasible platform planning. Finally, the effectiveness of the proposed method is illustrated through a case study. (C) 2016 Elsevier Ltd. All rights reserved.This research was carried out as a part of the CASES project which is supported by a Marie Curie International Research Staff Exchange Scheme Fellowship within the 7th European Community Framework Programme under the Grant agreement no. 294931. This research was also supported by National Natural Science Foundation of China (Nos. 51175262, 51575264); and Jiangsu Province
Science Foundation for Excellent Youths under Grant BK2012032.Wang, Q.; Dunbing, T.; Yin, L.; Salido, MA.; Giret Boggino, AS.; Xu, Y. (2016). Bi-objective optimization for low-carbon product family design. Robotics and Computer-Integrated Manufacturing. 41:53-65. https://doi.org/10.1016/j.rcim.2016.02.001S53654
A genetic algorithm for robust berth allocation and quay crane assignment
Scheduling problems usually obtain the optimal solutions assuming that the environment is deterministic. However, actually the environment is dynamic and uncertain. Thus, the initial data could change and the initial schedule obtained might be unfeasible. To overcome this issue, a proactive approach is presented for scheduling problems without any previous knowledge about the incidences that can occur. In this paper, we consider the berth allocation problem and the quay crane assignment problem as a representative example of scheduling problems where a typical objective is to minimize the service time. The robustness is introduced within this problem by means of buffer times that should be maximized to absorb possible incidences or breakdowns. Therefore, this problem becomes a multi-objective optimization problem with two opposite objectives: minimizing the total service time and maximizing the robustness or buffer time
- …