\n

\n \n 2023\n \n \n (1)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n \n Instance space analysis for 2D bin packing mathematical models.\n \n \n \n \n\n\n \n Liu, C.; Smith-Miles, K.; Wauters, T.; and Costa, A. M.\n\n\n \n\n\n\n European Journal of Operational Research. 2023.\n \n\n\n\n
\n\n\n\n \n \n $\"Instance$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n

\n

@article{liu_instance_2023,\n\ttitle = {Instance space analysis for {2D} bin packing mathematical models},\n\tissn = {0377-2217},\n\turl = {https://www.sciencedirect.com/science/article/pii/S0377221723009335},\n\tdoi = {10.1016/j.ejor.2023.12.008},\n\tabstract = {In this paper, we apply Instance Space Analysis (ISA) to study the two-dimensional bin-packing problem. We consider classical and newly-generated instances to test the performance of four mixed-integer programming (MIP) models from the literature. This is the first time ISA is used to compare MIP models. We set as a performance metric the time taken by the black-box MIP solver CPLEX to obtain a proven optimal solution when running each model. Our results provide a new perspective on the different models’ performance according to each instance’s features.},\n\turldate = {2023-12-20},\n\tjournal = {European Journal of Operational Research},\n\tauthor = {Liu, Chang and Smith-Miles, Kate and Wauters, Tony and Costa, Alysson M.},\n\tyear = {2023},\n\tkeywords = {Mixed integer programming, Packing, Instance generation, Instance space analysis, Performance evaluation},\n}\n

\n

\n\n\n\n\n\n

\n

\n \n 2022\n \n \n (6)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n \n Conserving workforce while temporarily rebalancing assembly lines under demand disruption.\n \n \n \n \n\n\n \n Michels, A. S.; and Costa, A. M.\n\n\n \n\n\n\n International Journal of Production Research, 60(21): 6616–6636. 2022.\n \n\n\n\n
\n\n\n\n \n \n $\"Conserving$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{michels_conserving_2022,\n\ttitle = {Conserving workforce while temporarily rebalancing assembly lines under demand disruption},\n\tvolume = {60},\n\tissn = {0020-7543, 1366-588X},\n\turl = {https://www.tandfonline.com/doi/full/10.1080/00207543.2021.1998694},\n\tdoi = {10.1080/00207543.2021.1998694},\n\tabstract = {In stable circumstances, assembly lines have workers with different capabilities assigned to stations. They perform a set of specialised tasks multiple times daily. Under a situation of high demand disruption (e.g. the COVID-19 pandemic), the overproduction rate would lead inventory levels to soar. An approach to cope with these demand drops and ongoing workforce costs is to dismiss employees and rebalance the line. Nevertheless, this implies social and economic costs related to rehiring and training. Alternatively, agreements can be made to reduce workload with a proportional wage deduction. These decisions are particularly challenging in heterogeneous workforces. We propose a Mixed-Integer Linear Programming (MILP) model to address the Assembly Line Worker Assignment and Rebalancing Problem (ALWARP). Our model aims at preserving jobs while minimising labour costs. We consider scenarios with falling demands and impose regularity metrics on workload reductions. Computational tests on benchmark datasets show that our strategy can distribute social costs among workers, with only slightly higher cumulative labour hours, while avoiding inconveniences associated with future renovations. A real-world case study of a truck cabin assembly line is investigated: the model can easily incorporate many realistic features and decide which workers should have their workload reduced and at which rate.},\n\tlanguage = {en},\n\tnumber = {21},\n\turldate = {2023-09-04},\n\tjournal = {International Journal of Production Research},\n\tauthor = {Michels, Adalberto Sato and Costa, Alysson M.},\n\tyear = {2022},\n\tpages = {6616--6636},\n\tfile = {Michels and Costa - 2022 - Conserving workforce while temporarily rebalancing.pdf:/Users/alysson/Zotero/storage/PNRWYBJT/Michels and Costa - 2022 - Conserving workforce while temporarily rebalancing.pdf:application/pdf},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n The vehicle allocation problem: alternative formulation and branch-and-price method.\n \n \n \n\n\n \n Cruz, C. A.; Costa, A. M.; Munari, P.; and Morabito, R.\n\n\n \n\n\n\n Computers and Operations Research. 2022.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{cruzvehicle,\n\ttitle = {The vehicle allocation problem: alternative formulation and branch-and-price method},\n\tabstract = {The Vehicle Allocation Problem (VAP) consists of repositioning empty vehicles acrossa set of terminals over a given planning horizon so as to maximize the profitsgenerated from serving demand for transportation of goods between pair of terminals.This problem has been classically modeled using an extended spacetime networkwhich captures the staging of the decision-making process. The present paperproposes a new mixed-integer programming (ILP) model based on the idea ofrepresenting the demands to be met as nodes on a graph. We also derive a Dantzig-Wolfe reformulation which is solved with a branch-and-price (BP) method. Theproposed BP uses a stabilized interior-point column generation approach anda branching procedure that imposes constraints in the master problem, thus notdamaging the structure of the subproblems. Additionally, we show that thesesubproblems can be solved efficiently using a shortest path algorithm on a directedacyclic graphs. Computational results are carried out on a realistic-sizedbenchmark instances, commonly used in the literature. The results show the efficacy ofthe proposed strategies. In particular, the BP method solved the whole set of instancesto proven optimality for the first time and in faster competitive times.},\n\tjournal = {Computers and Operations Research},\n\tauthor = {Cruz, C. A. and Costa, A. M. and Munari, P. and Morabito, R.},\n\tyear = {2022},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n An integrated multi-objective model for disaster waste clean-up systems optimization.\n \n \n \n \n\n\n \n Cheng, C.; Lu, J.; Zhu, R.; Xiao, Z.; Costa, A. M.; and Thompson, R. G.\n\n\n \n\n\n\n Transportation Research Part E: Logistics and Transportation Review, 165: 102867. 2022.\n \n\n\n\n
\n\n\n\n \n \n $\"An$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n

\n

@article{cheng_integrated_2022,\n\ttitle = {An integrated multi-objective model for disaster waste clean-up systems optimization},\n\tvolume = {165},\n\tissn = {1366-5545},\n\turl = {https://www.sciencedirect.com/science/article/pii/S1366554522002484},\n\tdoi = {10.1016/j.tre.2022.102867},\n\tabstract = {Post-disaster waste clean-up systems are complex and expensive operations that need to consider multiple stakeholders with different objectives. We propose a mixed-integer programming model that models the waste clean-up operations as a two-echelon system. The model decides on the location of waste processing facilities, the use of demolition resources, and the number and type of vehicles to be assigned to each echelon at each time slot of the planning horizon. The objectives considered in the model include minimizing environmental impacts, economic costs, and total time spent on the operations. Numerical results obtained on a case study based on the '2009 Victoria Black Saturday Bush-fires' case and on synthetically generated instances are used to obtain Pareto frontiers. The research concludes that the three objectives considered are indeed conflictive, and the explicit consideration of each goal can help decision-makers find the best trade-off solutions.},\n\tlanguage = {en},\n\turldate = {2022-09-24},\n\tjournal = {Transportation Research Part E: Logistics and Transportation Review},\n\tauthor = {Cheng, Cheng and Lu, Jia-Wei and Zhu, Rui and Xiao, Zuopeng and Costa, Alysson M. and Thompson, Russell G.},\n\tyear = {2022},\n\tkeywords = {Optimization, Disaster waste management, Environmental emission, Heavy-duty vehicles, Mixed integer programming, Pareto frontier},\n\tpages = {102867},\n\tfile = {ScienceDirect Snapshot:/Users/alysson/Zotero/storage/3AWL3IA9/S1366554522002484.html:text/html},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Mixed-integer linear programming models for the type-II resource-constrained assembly line balancing problem.\n \n \n \n \n\n\n \n Michels, A. S.; and Costa, A. M.\n\n\n \n\n\n\n Assembly Automation, 42: 585–594. 2022.\n \n\n\n\n
\n\n\n\n \n \n $\"Mixed-integer$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n\n\n

\n

@article{michels_mixed-integer_2022,\n\ttitle = {Mixed-integer linear programming models for the type-{II} resource-constrained assembly line balancing problem},\n\tvolume = {42},\n\tcopyright = {All rights reserved},\n\tissn = {0144-5154},\n\turl = {https://doi.org/10.1108/AA-10-2021-0140},\n\tdoi = {10.1108/AA-10-2021-0140},\n\tabstract = {Purpose Resource-constrained assembly lines are widely found in industries that manufacture complex products. In such lines, tasks may require specific resources to be processed. Therefore, decisions on which tasks and resources will be assigned to each station must be made. When the number of available stations is fixed, the problem’s main goal becomes the minimisation of cycle time (type-II version). This paper aims to explore this variant of the problem that lacks investigation in the literature. Design/methodology/approach In this paper, the authors propose mixed-integer linear programming (MILP) models to minimise cycle time in resource-constrained assembly lines, given a limited number of stations and resources. Dedicated and alternative resource types for tasks are considered in different scenarios. Findings Besides, past modelling decisions and assumptions are questioned. The authors discuss how they were leading to suboptimal solutions and offer a rectification. Practical implications The proposed models and data set fulfil more practical concerns by taking into account characteristics found in real-world assembly lines. Originality/value The proposed MILP models are applied to an existing data set, results are compared against a constraint programming model, and new optimal solutions are obtained. Moreover, a data set extension is proposed due to the simplicity of the current one and instances up to 70 tasks are optimally solved.},\n\turldate = {2022-09-24},\n\tjournal = {Assembly Automation},\n\tauthor = {Michels, Adalberto Sato and Costa, Alysson M.},\n\tyear = {2022},\n\tkeywords = {Assembly line balancing, Mixed-integer linear programming, Resource constraints, Type-II problem},\n\tpages = {585--594},\n\tfile = {Snapshot:/Users/alysson/Zotero/storage/H4SHEU8A/html.html:text/html},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Uncertainty representation in investment planning of low-carbon power systems.\n \n \n \n \n\n\n \n Moya, B.; Moreno, R.; Püschel-Løvengreen, S.; Costa, A. M.; and Mancarella, P.\n\n\n \n\n\n\n Electric Power Systems Research, 212: 108470. 2022.\n \n\n\n\n
\n\n\n\n \n \n $\"Uncertainty$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n

\n

@article{moya_uncertainty_2022,\n\ttitle = {Uncertainty representation in investment planning of low-carbon power systems},\n\tvolume = {212},\n\tcopyright = {All rights reserved},\n\tissn = {0378-7796},\n\turl = {https://www.sciencedirect.com/science/article/pii/S0378779622006034},\n\tdoi = {10.1016/j.epsr.2022.108470},\n\tabstract = {Power system operators and planners are dealing both with the integration of unparalleled levels of variable renewable energy sources and deep uncertainties that originate from new technological developments, changing regulatory frameworks, unknown investment, operational costs of technologies, etc. An inadequate representation of the uncertainties may result in a substantial risk of deploying inflexible investment solutions incapable of adapting efficiently to evolving scenarios. In this context, this work studies the effects of increasing the granularity used to represent the long-term uncertainty by analysing its impact on the resulting optimal portfolios of new transmission lines, battery energy storage systems and pumped-hydro storage systems. The studies are conducted on an instance of the Australian power system described by the system operator for planning purposes, including four types of uncertainty granularity, namely deterministic representation, and 2-stage, 3-stage and 4-stage stochastic representations. To address the computational challenges associated with the large mixed-integer linear stochastic problems, the different instances are reformulated using Dantzig-Wolfe decomposition, enabling the use of a column generation approach to solve the investment problem. The case study applications show substantial adjustments in the investment portfolios as uncertainty granularity changes, with a clear tendency to increase battery storage investment as uncertainty is better represented.},\n\tlanguage = {en},\n\turldate = {2023-02-01},\n\tjournal = {Electric Power Systems Research},\n\tauthor = {Moya, Bastian and Moreno, Rodrigo and Püschel-Løvengreen, Sebastián and Costa, Alysson M. and Mancarella, Pierluigi},\n\tyear = {2022},\n\tkeywords = {Australian power system, Column generation, Investment flexibility, Low-carbon power system planning, Stochastic optimization},\n\tpages = {108470},\n\tfile = {ScienceDirect Snapshot:/Users/alysson/Zotero/storage/2IA6K3XA/S0378779622006034.html:text/html},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Drayage routing with heterogeneous fleet, compatibility constraints, and truck load configurations.\n \n \n \n \n\n\n \n Bustos-Coral, D.; and Costa, A. M.\n\n\n \n\n\n\n Transportation Research Part E: Logistics and Transportation Review, 168: 102922. 2022.\n \n\n\n\n
\n\n\n\n \n \n $\"Drayage$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{bustos-coral_drayage_2022,\n\ttitle = {Drayage routing with heterogeneous fleet, compatibility constraints, and truck load configurations},\n\tvolume = {168},\n\tissn = {13665545},\n\turl = {https://linkinghub.elsevier.com/retrieve/pii/S136655452200299X},\n\tdoi = {10.1016/j.tre.2022.102922},\n\tabstract = {This paper addresses drayage routing problems with heterogeneous fleets, compatibility constraints, and truck load configurations. In these problems, containers can be of any size and cargo category. In addition, compatibility and load configuration constraints define which and how many containers can be transported by each truck. We propose a state transition logic to model these constraints. Based on this logic, we develop two mixed-integer programming models for this family of problems. The first model is a compact formulation that can be input into a black-box solver. The second model combines partial routes in a space–time network and is solved with a tailored branch-and-cut approach. To analyze the efficiency of the proposed models, we conduct extensive computational tests on instances with different numbers of requests, geographical distributions of locations, time-window lengths, and fleet compositions. Moreover, we discuss how our modeling approach can assist decision-making in three different drayage routing applications.},\n\tlanguage = {en},\n\turldate = {2024-01-17},\n\tjournal = {Transportation Research Part E: Logistics and Transportation Review},\n\tauthor = {Bustos-Coral, Daniel and Costa, Alysson M.},\n\tyear = {2022},\n\tpages = {102922},\n\tfile = {Bustos-Coral and Costa - 2022 - Drayage routing with heterogeneous fleet, compatib.pdf:/Users/alysson/Zotero/storage/AYKAP6EG/Bustos-Coral and Costa - 2022 - Drayage routing with heterogeneous fleet, compatib.pdf:application/pdf},\n}\n\n

\n

\n\n\n\n\n\n

\n

\n \n 2021\n \n \n (4)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n \n Multi-period two-echelon location routing problem for disaster waste clean-up.\n \n \n \n \n\n\n \n Cheng, C.; Zhu, R.; Costa, A. M.; Thompson, R. G.; and Huang, X.\n\n\n \n\n\n\n Transportmetrica A: Transport Science, 18: 1053–1083. 2021.\n \n\n\n\n
\n\n\n\n \n \n $\"Multi-period$ Link\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n

\n

@article{cheng_multi-period_2021,\n\ttitle = {Multi-period two-echelon location routing problem for disaster waste clean-up},\n\tvolume = {18},\n\tissn = {2324-9935},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2022/02/Cheng-et-al.-2021-Multi-period-two-echelon-location-routing-problem-.pdf},\n\tdoi = {https://doi.org/10.1016/j.tre.2022.102922},\n\tabstract = {Waste clean-up after a disaster is one of the most critical tasks in the response stage of disaster management. We develop a model to minimise the cost and duration of disaster waste clean-up considering using Temporary Disaster Waste Management Sites (TDWMSs), which can store and process waste before it is sent to the final disposal sites. The problem that arises can be seen as a Multi-Period Two-echelon Location Routing Problem (MP-2ELRP) in which the main decisions are the location of the TDWMSs and the routing of vehicles in both echelons. In this paper, we propose both a mixed-integer program and a Genetic Algorithm (GA) to model and solve the problem. Computational tests indicate: (i) the performance of proposed GA is robust; (ii) the use of TDWMSs can reduce both total waste clean-up cost and duration; and (iii) the capacities of TDWMSs have a significant impact on the total waste clean-up time and duration.},\n\turldate = {2021-05-05},\n\tjournal = {Transportmetrica A: Transport Science},\n\tauthor = {Cheng, C. and Zhu, R. and Costa, A. M. and Thompson, R. G. and Huang, X.},\n\tyear = {2021},\n\tkeywords = {Disaster waste management, genetic algorithm, greedy algorithm, MIP, two-echelon location routing problem},\n\tpages = {1053--1083},\n\tfile = {Cheng et al. - 2021 - Multi-period two-echelon location routing problem .pdf:/Users/alysson/Zotero/storage/M86Y47LH/Cheng et al. - 2021 - Multi-period two-echelon location routing problem .pdf:application/pdf;Full Text PDF:/Users/alysson/Zotero/storage/LV6HWF8Y/Cheng et al. - 2021 - Multi-period two-echelon location routing problem .pdf:application/pdf},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Network scheduling problem with cross-docking and loading constraints.\n \n \n \n \n\n\n \n Castellucci, P. B.; Costa, A. M.; and Toledo, F.\n\n\n \n\n\n\n Computers & Operations Research, 132 (online first). 2021.\n \n\n\n\n
\n\n\n\n \n \n $\"Network$ Link\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{castellucci21network,\n\ttitle = {Network scheduling problem with cross-docking and loading constraints},\n\tvolume = {132 (online first)},\n\tcopyright = {All rights reserved},\n\tissn = {0305-0548},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2022/02/Castellucci-et-al.-2021-Network-scheduling-problem-with-cross-docking-and-.pdf},\n\tdoi = {10.1016/j.cor.2021.105271},\n\tabstract = {Cross-docking is a logistic strategy which can increase rates of consolidation, and reduce distribution and storage costs and delivery times. The optimization literature on cross-docking has mostly focused on the modeling and solution of problems considering a single cross-docking facility. Networks with multiple cross-docks remain rather unexplored and the few papers that deal with the problem do this by simplifying the geometry of the goods. We intend to shorten this gap by proposing a mixed-integer linear programming model for optimizing distribution and delay costs for the transportation of goods in open networks with multiple cross-docks considering the three-dimensional aspects of the cargo. Also, we propose a logic-based Benders decomposition strategy which allow for the solution of larger instances when compared with those that can be handled by a branch-and-cut MIP solver. Experiments showed that the decomposition can handle instances with two times more nodes and five times more boxes than a direct use of the solver. Also, the framework is flexible enough to accommodate other features of practical cases.},\n\tlanguage = {en},\n\turldate = {2021-04-15},\n\tjournal = {Computers \\& Operations Research},\n\tauthor = {Castellucci, P. B. and Costa, A. M. and Toledo, F.M.B},\n\tyear = {2021},\n\tfile = {Castellucci et al. - 2021 - Network scheduling problem with cross-docking and .pdf:/Users/alysson/Zotero/storage/7PTPHJPX/Castellucci et al. - 2021 - Network scheduling problem with cross-docking and .pdf:application/pdf;Castellucci et al. - 2021 - Network scheduling problem with cross-docking and .pdf:/Users/alysson/Zotero/storage/6GEHPY5A/Castellucci et al. - 2021 - Network scheduling problem with cross-docking and .pdf:application/pdf},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n Optimisation of waste clean-up after large-scale disasters.\n \n \n \n\n\n \n Cheng, C.; Zhu, R.; Costa, A. M.; and Thompson, R. G.\n\n\n \n\n\n\n Waste Management, 119: 1–10. 2021.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{cheng21optimisation,\n\ttitle = {Optimisation of waste clean-up after large-scale disasters},\n\tvolume = {119},\n\tcopyright = {All rights reserved},\n\tissn = {0956-053X},\n\tdoi = {10.1016/j.wasman.2020.09.023},\n\tabstract = {Disaster waste clean-up after large disasters is one of the core activities at the recovery stage of disaster management, which aims to restoring the normal functioning of the disaster affected area. In this paper we considered a waste clean-up system consists of (i) demolition operation, (ii) collection of waste from customer nodes to temporary disaster waste management sites (TDWMSs), (iii) processing at TDWMSs, and (iv) transportation of the waste to final disposal sites in the recovery of disasters. A multi-objective mixed integer programming model is developed to minimise the total clean-up cost and time. Three different approaches are developed to solve the problem, which are tested with artificial instances and a real case study. Results of artificial instances indicate that the models developed can be used to obtain close to optimal solutions within an acceptable computing time. Results of the case study can facilitate the decision-makers to develop the waste clean-up with minimised total cost and clean-up time by selecting the right location of TDWMSs and setting up the proper waste clean-up schedule.},\n\tlanguage = {en},\n\turldate = {2021-02-10},\n\tjournal = {Waste Management},\n\tauthor = {Cheng, C. and Zhu, R. and Costa, A. M. and Thompson, R. G.},\n\tyear = {2021},\n\tpages = {1--10},\n\tfile = {Cheng et al. - 2021 - Optimisation of waste clean-up after large-scale d.pdf:/Users/alysson/Zotero/storage/6GSLAB3P/Cheng et al. - 2021 - Optimisation of waste clean-up after large-scale d.pdf:application/pdf},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Application of the Bi‐Level Location‐Routing Problem for Post‐Disaster Waste Collection.\n \n \n \n \n\n\n \n Cheng, C.; Thompson, R. G.; Costa, A.; and Huang, X.\n\n\n \n\n\n\n In Taniguchi, E.; and Thompson, R., editor(s), City Logistics 2: Modeling and Planning Initiatives. Wiley, 2021.\n \n\n\n\n
\n\n\n\n \n \n $\"Application$ Link\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@incollection{cheng21application,\n\ttitle = {Application of the {Bi}‐{Level} {Location}‐{Routing} {Problem} for {Post}‐{Disaster} {Waste} {Collection}},\n\tcopyright = {All rights reserved},\n\tisbn = {978-1-119-49511-6},\n\turl = {Link=https://www.wiley.com/en-au/City+Logistics+2:+Modeling+and+Planning+Initiatives-p-9781119495116},\n\turldate = {2021-02-10},\n\tbooktitle = {City {Logistics} 2: {Modeling} and {Planning} {Initiatives}},\n\tpublisher = {Wiley},\n\tauthor = {Cheng, C. and Thompson, R. G. and Costa, A.M. and Huang, X.},\n\teditor = {Taniguchi, E. and Thompson, R.G.},\n\tyear = {2021},\n}\n\n

\n

\n\n\n\n

\n\n\n\n\n\n

\n

\n \n 2020\n \n \n (2)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n A note to: A multiple-rule based constructive randomized search algorithm for solving assembly line worker assignment and balancing problem.\n \n \n \n\n\n \n Michels, A. S.; and Costa, A. M.\n\n\n \n\n\n\n Journal of Intelligent Manufacturing, 32: 2121–2124. 2020.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n\n\n\n

\n

@article{michels20note,\n\ttitle = {A note to: {A} multiple-rule based constructive randomized search algorithm for solving assembly line worker assignment and balancing problem},\n\tvolume = {32},\n\tcopyright = {All rights reserved},\n\tissn = {1572-8145},\n\tdoi = {10.1007/s10845-020-01632-8},\n\tabstract = {Some of the solutions reported in a recent paper (Akyol and Baykasoglu in J Intell Manuf 30(2):557–573, 2019. https://doi.org/10.1007/s10845-016-1262-6) are infeasible, jeopardising the conclusion that “best results for the 75\\% of the 320 test instances for the ALWABP-2” were obtained. In this note, we explore the contributions of the paper, show that some of the solutions are indeed infeasible and point out possible inconsistencies in the employed heuristic that may be causing this issue.},\n\tlanguage = {en},\n\turldate = {2021-02-10},\n\tjournal = {Journal of Intelligent Manufacturing},\n\tauthor = {Michels, A. S. and Costa, A. M.},\n\tyear = {2020},\n\tkeywords = {Assembly line balancing, Mixed integer linear programming, Worker assignment},\n\tpages = {2121--2124},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems.\n \n \n \n \n\n\n \n Saviniec, L.; Santos, M. O.; Costa, A. M.; and Santos, L. M. R.\n\n\n \n\n\n\n European Journal of Operational Research, 280: 1064–1081. 2020.\n \n\n\n\n
\n\n\n\n \n \n $\"Pattern-based$ Link\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{saviniec20patternbased,\n\ttitle = {Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems},\n\tvolume = {280},\n\tcopyright = {All rights reserved},\n\tissn = {0377-2217},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2022/02/Saviniec-et-al.-2020-Pattern-based-models-and-a-cooperative-parallel-me.pdf},\n\tdoi = {10.1016/j.ejor.2019.08.001},\n\tabstract = {High school timetabling problems consist in building periodic timetables for class-teacher meetings considering compulsory and non-compulsory requirements. This family of problems has been widely studied since the 1950s, mostly via mixed-integer programming and metaheuristic techniques. However, the efficient search of optimal or near-optimal solutions is still a challenge for many problems of practical size. In this paper, we investigate mixed-integer programming formulations and a parallel metaheuristic based algorithm for solving high school timetabling problems with compactness and balancing requirements. We propose two pattern-based formulations and a solution algorithm that simultaneously exploits column generation and a team of metaheuristics to build and improve solutions. Extensive computational experiments conducted with real-world instances demonstrate that our formulations are competitive with the best existing high school timetabling formulations, while our parallel algorithm presents superior performance to alternative methods available in the literature.},\n\tlanguage = {en},\n\turldate = {2021-05-10},\n\tjournal = {European Journal of Operational Research},\n\tauthor = {Saviniec, L. and Santos, M. O. and Costa, A. M. and Santos, L. M. R.},\n\tyear = {2020},\n\tpages = {1064--1081},\n\tfile = {Saviniec et al. - 2020 - Pattern-based models and a cooperative parallel me.pdf:/Users/alysson/Zotero/storage/95EEPJKH/Saviniec et al. - 2020 - Pattern-based models and a cooperative parallel me.pdf:application/pdf;Saviniec et al. - 2020 - Pattern-based models and a cooperative parallel me.pdf:/Users/alysson/Zotero/storage/PCFYJHMP/Saviniec et al. - 2020 - Pattern-based models and a cooperative parallel me.pdf:application/pdf},\n}\n\n

\n

\n\n\n\n\n\n

\n

\n \n 2019\n \n \n (3)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n A co-evolutionary matheuristic for the car rental capacity-pricing stochastic problem.\n \n \n \n\n\n \n Oliveira, B. B.; Carravilla, M. A.; Oliveira, J. F.; and Costa, A. M.\n\n\n \n\n\n\n European Journal of Operational Research, 276: 637–655. 2019.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{oliveira19coevolutionary,\n\ttitle = {A co-evolutionary matheuristic for the car rental capacity-pricing stochastic problem},\n\tvolume = {276},\n\tcopyright = {All rights reserved},\n\tissn = {0377-2217},\n\tdoi = {10.1016/j.ejor.2019.01.015},\n\tabstract = {When planning a selling season, a car rental company must decide on the number and type of vehicles in the fleet to meet demand. The demand for the rental products is uncertain and highly price-sensitive, and thus capacity and pricing decisions are interconnected. Moreover, since the products are rentals, capacity “returns”. This creates a link between capacity with fleet deployment and other tools that allow the company to meet demand, such as upgrades, transferring vehicles between locations or temporarily leasing additional vehicles. We propose a methodology that aims to support decision-makers with different risk profiles plan a season, providing good solutions and outlining their ability to deal with uncertainty when little information about it is available. This matheuristic is based on a co-evolutionary genetic algorithm, where parallel populations of solutions and scenarios co-evolve. The fitness of a solution depends on the risk profile of the decision-maker and its performance against the scenarios, which is obtained by solving a mathematical programming model. The fitness of a scenario is based on its contribution in making the scenario population representative and diverse. This is measured by the impact the scenarios have on the solutions. Computational experiments show the potential of this methodology regarding the quality of the solutions obtained and the diversity and representativeness of the set of scenarios generated. Its main advantages are that no information regarding probability distributions is required, it supports different decision-making risk profiles, and it provides a set of good solutions for an innovative complex application.},\n\tlanguage = {en},\n\turldate = {2021-05-12},\n\tjournal = {European Journal of Operational Research},\n\tauthor = {Oliveira, B. B. and Carravilla, M. A. and Oliveira, J. F. and Costa, A. M.},\n\tyear = {2019},\n\tpages = {637--655},\n\tfile = {Oliveira et al. - 2019 - A co-evolutionary matheuristic for the car rental .pdf:/Users/alysson/Zotero/storage/LDUIVU3F/Oliveira et al. - 2019 - A co-evolutionary matheuristic for the car rental .pdf:application/pdf;ScienceDirect Snapshot:/Users/alysson/Zotero/storage/9QR4G4Q4/S0377221719300177.html:text/html},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Examining Trade-Offs in Piggybacking Flow Events while Making Environmental Release Decisions in a River System.\n \n \n \n \n\n\n \n Kaur, S.; Horne, A. C.; Nathan, R.; Szemis, J. M.; Gibson, L.; Costa, A. M.; Angus Webb, J.; and Stewardson, M.\n\n\n \n\n\n\n Journal of Water Resources Planning and Management, 145(6): 1–10. 2019.\n Publisher: American Society of Civil Engineers\n\n\n\n
\n\n\n\n \n \n $\"Examining$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{kaur19examining,\n\ttitle = {Examining {Trade}-{Offs} in {Piggybacking} {Flow} {Events} while {Making} {Environmental} {Release} {Decisions} in a {River} {System}},\n\tvolume = {145},\n\tcopyright = {©2019 American Society of Civil Engineers},\n\tissn = {1943-5452},\n\turl = {http://ascelibrary.org/doi/abs/10.1061/%28ASCE%29WR.1943-5452.0001048},\n\tdoi = {10.1061/(ASCE)WR.1943-5452.0001048},\n\tabstract = {High flow pulses (or spells or freshes) play a crucial role in maintaining the ecological health of a river system. Impoundment of water in a reservoir and release or diversion of water for human water needs has significantly altered the magnitude and frequency of flow pulses in many river systems, often reducing river ecological health. A limited volume of water is sometimes available for release into the river to reintroduce pulses specifically aimed at meeting ecological requirements (environmental water). If aiming to achieve maximum environmental benefit, such releases from the reservoir should be timed to augment or piggyback natural unregulated catchment flow events. These decisions must be made in presence of uncertainty of near-future unregulated catchment inflows entering the river. Making flow release decisions under this uncertainty poses the risk of either not achieving the benefit of the environmental flow release because too little environmental water is released, or of causing flood damage because too much is released. To date, assessment of risks associated with piggybacking environmental flows have focused solely on the flooding risks. This paper considers assessment of trade-offs between environmental risks and flooding risks while making piggybacking decisions. The key contribution of the paper is a risk framework that allows for the assessment of both flooding and environmental risks when piggybacking of natural flow pulses occurs. The risk framework is used to assess rules or rules with varying levels of piggybacking on the trade-offs between environmental outcomes and flooding risks when releasing piggybacking flows under these rules for flow events under near-future forecast uncertainty. Spawning flows for a key fish species in the Yarra River in southeast Australia is used as a case study to compare three piggybacking rules.},\n\tlanguage = {EN},\n\tnumber = {6},\n\turldate = {2021-05-12},\n\tjournal = {Journal of Water Resources Planning and Management},\n\tauthor = {Kaur, S. and Horne, A. C. and Nathan, R. and Szemis, J. M. and Gibson, L. and Costa, Alysson M. and Angus Webb, J. and Stewardson, Michael},\n\tyear = {2019},\n\tnote = {Publisher: American Society of Civil Engineers},\n\tpages = {1--10},\n\tfile = {Kaur et al. - 2019 - Examining Trade-Offs in Piggybacking Flow Events w.pdf:/Users/alysson/Zotero/storage/B2MTM3KU/Kaur et al. - 2019 - Examining Trade-Offs in Piggybacking Flow Events w.pdf:application/pdf;Snapshot:/Users/alysson/Zotero/storage/SB28R7LG/(ASCE)WR.1943-5452.html:text/html},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Output maximization container loading problem with time availability constraints.\n \n \n \n \n\n\n \n Castellucci, P. B.; Toledo, F. M. B.; and Costa, A. M.\n\n\n \n\n\n\n Operations Research Perspectives, 6: 100–126. 2019.\n \n\n\n\n
\n\n\n\n \n \n $\"Output$ Link\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{castellucci19output,\n\ttitle = {Output maximization container loading problem with time availability constraints},\n\tvolume = {6},\n\tcopyright = {All rights reserved},\n\tissn = {2214-7160},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2022/02/CASTELLUCCI_CLPTAC_Om.pdf},\n\tdoi = {10.1016/j.orp.2019.100126},\n\tabstract = {Research on container loading problems has helped increase the occupation rate of containers in different practical situations. We consider these problems within a context which might pressure the loading process, leading to sub-optimal solutions. Some facilities like cross-docks have reduced storage space which might force early loading activities. We propose a container loading problem which accounts for this limited storage by explicitly considering the schedule of arrival for the boxes and the departure time of the trucks. Also, we design a framework which handles the geometric and temporal characteristics of the problem separately, enabling the use of methods found in the literature for solving the extended problem. Our framework can handle uncertainty in the schedule and be used to quantify the impact of delays on capacity utilization and departure time of trucks.},\n\tlanguage = {en},\n\turldate = {2021-05-12},\n\tjournal = {Operations Research Perspectives},\n\tauthor = {Castellucci, P. B. and Toledo, F. M. B. and Costa, A. M.},\n\tyear = {2019},\n\tpages = {100--126},\n\tfile = {Castellucci et al. - 2019 - Output maximization container loading problem with.pdf:/Users/alysson/Zotero/storage/9PZ77CZ3/Castellucci et al. - 2019 - Output maximization container loading problem with.pdf:application/pdf;CASTELLUCCI_CLPTAC_Om.pdf:/Users/alysson/Zotero/storage/IQ5L6NL6/CASTELLUCCI_CLPTAC_Om.pdf:application/pdf;ScienceDirect Snapshot:/Users/alysson/Zotero/storage/XRVQVSTH/S2214716019300910.html:text/html},\n}\n\n

\n

\n\n\n\n\n\n

\n

\n \n 2018\n \n \n (4)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n \n Parallel local search algorithms for high school timetabling problems.\n \n \n \n \n\n\n \n Saviniec, L.; Santos, M. O.; and Costa, A. M.\n\n\n \n\n\n\n European Journal of Operational Research, 265: 81–98. 2018.\n \n\n\n\n
\n\n\n\n \n \n $\"Parallel$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{saviniec18parallel,\n\ttitle = {Parallel local search algorithms for high school timetabling problems},\n\tvolume = {265},\n\tcopyright = {All rights reserved},\n\tissn = {0377-2217},\n\turl = {https://www.sciencedirect.com/science/article/pii/S0377221717306562},\n\tdoi = {10.1016/j.ejor.2017.07.029},\n\tabstract = {High school timetabling consists in assigning meetings between classes and teachers, with the goal of minimizing the violation of specific soft requirements. This family of problems has been frequently considered in the literature, but few strategies employing parallelism have been proposed. In this exploratory study, we consider two different parallel frameworks and present a thorough computational study in order to understand algorithmic decisions that are closely related to performance. Our best algorithm outperforms state-of-the-art algorithms for variants of the problem considered, indicating both the efficiency and the flexibility of the method.},\n\tlanguage = {en},\n\turldate = {2021-05-10},\n\tjournal = {European Journal of Operational Research},\n\tauthor = {Saviniec, L. and Santos, M. O. and Costa, A. M.},\n\tyear = {2018},\n\tpages = {81--98},\n\tfile = {Saviniec et al. - 2018 - Parallel local search algorithms for high school t.pdf:/Users/alysson/Zotero/storage/7UY5P433/Saviniec et al. - 2018 - Parallel local search algorithms for high school t.pdf:application/pdf;ScienceDirect Snapshot:/Users/alysson/Zotero/storage/DX4I8M5M/S0377221717306562.html:text/html},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n Improved integer programming models for simple assembly line balancing and related problems.\n \n \n \n\n\n \n Ritt, M.; and Costa, A.\n\n\n \n\n\n\n International Transactions in Operational Research, 25: 1345–1359. 2018.\n ZSCC: 0000024\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{ritt18improved,\n\ttitle = {Improved integer programming models for simple assembly line balancing and related problems},\n\tvolume = {25},\n\tcopyright = {All rights reserved},\n\tjournal = {International Transactions in Operational Research},\n\tauthor = {Ritt, M. and Costa, A.M.},\n\tyear = {2018},\n\tnote = {ZSCC: 0000024},\n\tpages = {1345--1359},\n\tfile = {Ritt and Costa - 2018 - Improved integer programming models for simple ass.pdf:/Users/alysson/Zotero/storage/MM4YES8M/Ritt and Costa - 2018 - Improved integer programming models for simple ass.pdf:application/pdf},\n}\n\n

\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Active Management of Environmental Water to Improve Ecological Outcomes.\n \n \n \n \n\n\n \n Horne, A. C.; Kaur, S.; Szemis, J. M.; Costa, A. M.; Nathan, R.; Angus Webb, J.; Stewardson, M.; and Boland, N.\n\n\n \n\n\n\n Journal of Water Resources Planning and Management, 144(12): 1–10. 2018.\n Publisher: American Society of Civil Engineers\n\n\n\n
\n\n\n\n \n \n $\"Active$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{horne18active,\n\ttitle = {Active {Management} of {Environmental} {Water} to {Improve} {Ecological} {Outcomes}},\n\tvolume = {144},\n\tcopyright = {©2018 American Society of Civil Engineers},\n\tissn = {1943-5452},\n\turl = {http://ascelibrary.org/doi/abs/10.1061/%28ASCE%29WR.1943-5452.0000991},\n\tdoi = {10.1061/(ASCE)WR.1943-5452.0000991},\n\tabstract = {Environmental water is being embraced by governments around the world as a means to partly restore rivers impacted by excessive river regulation and to protect those that are not yet overregulated. In cases where environmental water is provided as a water right, managers can make ongoing active management decisions regarding the timing and magnitude of environmental flows in response to changing conditions and understanding of environmental demands. Such active management should lead to improved environmental outcomes but also comes with a significant ongoing management cost when compared to rules-based environmental water releases. This study uses an optimization tool to examine the environmental gain achievable with the active management of environmental water compared to rules-based releases. A case study of the Yarra River, Victoria, Australia, demonstrates the potential for substantial environmental gains achieved through active management of environmental water.},\n\tlanguage = {EN},\n\tnumber = {12},\n\turldate = {2021-05-12},\n\tjournal = {Journal of Water Resources Planning and Management},\n\tauthor = {Horne, A. C. and Kaur, S. and Szemis, J. M. and Costa, A. M. and Nathan, R. and Angus Webb, J. and Stewardson, M.J. and Boland, N.},\n\tyear = {2018},\n\tnote = {Publisher: American Society of Civil Engineers},\n\tpages = {1--10},\n\tfile = {Horne et al. - 2018 - Active Management of Environmental Water to Improv.pdf:/Users/alysson/Zotero/storage/5YBZ4VBM/Horne et al. - 2018 - Active Management of Environmental Water to Improv.pdf:application/pdf;Snapshot:/Users/alysson/Zotero/storage/LSN665DU/(ASCE)WR.1943-5452.html:text/html},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A sequential stochastic mixed integer programming model for tactical master surgery scheduling.\n \n \n \n \n\n\n \n Kumar, A.; Costa, A. M.; Fackrell, M.; and Taylor, P. G.\n\n\n \n\n\n\n European Journal of Operational Research, 270: 734–746. 2018.\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Link\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{kumar18sequential,\n\ttitle = {A sequential stochastic mixed integer programming model for tactical master surgery scheduling},\n\tvolume = {270},\n\tcopyright = {All rights reserved},\n\tissn = {0377-2217},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2018/06/draft-ashwani18sequential-2kqm3tv.pdf},\n\tdoi = {10.1016/j.ejor.2018.04.007},\n\tabstract = {In this paper, we develop a stochastic mixed integer programming model to optimise the tactical master surgery schedule (MSS) in order to achieve a better patient flow under downstream capacity constraints. We optimise the process over several scheduling periods and we use various sequences of randomly generated patients’ length of stay scenario realisations to model the uncertainty in the process. This model has the particularity that the scenarios are chronologically sequential, not parallel. We use a very simple approach to enhance the non-anticipative feature of the model, and we empirically demonstrate that our approach is useful in achieving the desired objective. We use simulation to show that the most frequently optimal schedule is the best schedule for implementation. Furthermore, we analyse the effect of varying the penalty factor, an input parameter that decides the trade-off between the number of cancellations and occupancy level, on the patient flow process. Finally, we develop a robust MSS to maximise the utilisation level while keeping the number of cancellations within acceptable limits.},\n\tlanguage = {en},\n\turldate = {2021-05-12},\n\tjournal = {European Journal of Operational Research},\n\tauthor = {Kumar, A. and Costa, A. M. and Fackrell, M. and Taylor, P. G.},\n\tyear = {2018},\n\tpages = {734--746},\n\tfile = {Kumar et al. - 2018 - A sequential stochastic mixed integer programming .pdf:/Users/alysson/Zotero/storage/PYXN8KFD/Kumar et al. - 2018 - A sequential stochastic mixed integer programming .pdf:application/pdf;ScienceDirect Snapshot:/Users/alysson/Zotero/storage/IJ4DQXXA/S0377221718303102.html:text/html},\n}\n\n

\n

\n\n\n\n\n\n

\n

\n \n 2017\n \n \n (3)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n \n Using optimization to develop a “designer” environmental flow regime.\n \n \n \n \n\n\n \n Horne, A.; Kaur, S.; Szemis, J.; Costa, A. M.; Webb, J. A.; Nathan, R.; Stewardson, M.; Lowe, L.; and Boland, N.\n\n\n \n\n\n\n Environmental Modelling & Software, 88: 188–199. 2017.\n ZSCC: 0000032 tex.ids= horne17usinga\n\n\n\n
\n\n\n\n \n \n $\"Using$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{horne17using,\n\ttitle = {Using optimization to develop a “designer” environmental flow regime},\n\tvolume = {88},\n\tcopyright = {All rights reserved},\n\tissn = {1364-8152},\n\turl = {https://www.sciencedirect.com/science/article/pii/S1364815216302225},\n\tdoi = {10.1016/j.envsoft.2016.11.020},\n\tabstract = {There are increasing numbers of rivers with large storages, resulting in changes to environmental condition downstream. In these systems, environmental flow regimes that are specifically designed to meet environmental management objectives, whilst continuing to support economic needs, may be the best approach. A challenge remains as to how best to design these novel flow regimes. Decision support tools such as optimization provide a potential tool to achieve this. In existing tools environmental outcomes are not represented with sufficient realism and this is a major barrier to successful adoption by decision-makers. Here, we employ conditional probability networks as a promising approach that provides both ease of modelling and a direct link to ecological outcomes and processes. We present a generic model that can be used to represent any ecological endpoint within a river system. We then demonstrate the approach using two fish species in the Yarra River, Victoria.},\n\tlanguage = {en},\n\turldate = {2021-03-25},\n\tjournal = {Environmental Modelling \\& Software},\n\tauthor = {Horne, A. and Kaur, S. and Szemis, J. and Costa, A. M. and Webb, J. A. and Nathan, Rory and Stewardson, Michael and Lowe, Lisa and Boland, Natashia},\n\tyear = {2017},\n\tnote = {ZSCC: 0000032\ntex.ids= horne17usinga},\n\tpages = {188--199},\n\tfile = {Horne et al. - 2017 - Using optimization to develop a “designer” environ.pdf:/Users/alysson/Zotero/storage/T8TFAZ59/Horne et al. - 2017 - Using optimization to develop a “designer” environ.pdf:application/pdf;ScienceDirect Snapshot:/Users/alysson/Zotero/storage/QAQ38MT6/S1364815216302225.html:text/html;ScienceDirect Snapshot:/Users/alysson/Zotero/storage/E8KF2EIC/S1364815216302225.html:text/html},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n The multi-objective assembly line worker integration and balancing problem of type-2.\n \n \n \n \n\n\n \n Moreira, M. C. O.; Pastor, R.; Costa, A. M.; and Miralles, C.\n\n\n \n\n\n\n Computers & Operations Research, 82: 114–125. 2017.\n \n\n\n\n
\n\n\n\n \n \n $\"The$ Link\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{moreira17multiobjective,\n\ttitle = {The multi-objective assembly line worker integration and balancing problem of type-2},\n\tvolume = {82},\n\tcopyright = {All rights reserved},\n\tissn = {0305-0548},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2018/06/draft-moreira17multi-24ojx5j.pdf},\n\tdoi = {10.1016/j.cor.2017.01.003},\n\tabstract = {The consideration of worker heterogeneity in assembly lines has received a fair amount of attention in the literature in the past decade. Most of this exploration uses as motivation the example of assembly lines in sheltered work centers for the disabled. Only recently has the community started looking at the situation faced in assembly lines in the general industrial park, when in the presence of worker heterogeneity. This step raises a number of questions around the best way to incorporate heterogeneous workers in the line, maximizing their integration while maintaining productivity levels. In this paper we propose the use of Miltenburg’s regularity criterion and cycle time as metrics for integration of workers and productivity, respectively. We then define, model and develop heuristics for a line balancing problem with these two goals. Results obtained through an extensive set of computational experiments indicate that a good planning can obtain trade-off solutions that perform well in both objectives.},\n\tlanguage = {en},\n\turldate = {2021-05-10},\n\tjournal = {Computers \\& Operations Research},\n\tauthor = {Moreira, M. C. O. and Pastor, R. and Costa, A. M. and Miralles, C.},\n\tyear = {2017},\n\tpages = {114--125},\n\tfile = {Moreira et al. - 2017 - The multi-objective assembly line worker integrati.pdf:/Users/alysson/Zotero/storage/XB9S43XW/Moreira et al. - 2017 - The multi-objective assembly line worker integrati.pdf:application/pdf},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Challenges for determining frequency of high flow spells for varying thresholds in environmental flows programmes.\n \n \n \n \n\n\n \n Kaur, S.; Horne, A.; Stewardson, M. J.; Nathan, R.; Costa, A. M.; Szemis, J. M.; and Webb, J. A.\n\n\n \n\n\n\n Journal of Ecohydraulics, 2: 28–37. 2017.\n Publisher: Taylor & Francis _eprint: https://doi.org/10.1080/24705357.2016.1276418\n\n\n\n
\n\n\n\n \n \n $\"Challenges$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{kaur17challenges,\n\ttitle = {Challenges for determining frequency of high flow spells for varying thresholds in environmental flows programmes},\n\tvolume = {2},\n\tcopyright = {All rights reserved},\n\tissn = {2470-5357},\n\turl = {https://doi.org/10.1080/24705357.2016.1276418},\n\tdoi = {10.1080/24705357.2016.1276418},\n\tabstract = {High flow spells (or “pulses”) are important flow components providing ecological triggers and connectivity in rivers. While the ecological importance of flow spells is well-recognized, the link between ecosystem processes and statistical methods used to define flow spells occurrence has received little attention. Commonly, a spell is defined as an event that exceeds a threshold for a minimum number of consecutive days; however, such arbitrary metrics may be ecologically irrelevant. For example, the ecological value of a sustained high flow spell may be unaffected by a brief period in which flows fall just below the nominated threshold. The inclusion of an independence criterion has the potential to better characterize the ecological relevance of spell metrics, but it introduces the additional problem of how best to define “independence”. Existing techniques present inconsistencies in the number of spells identified as the thresholds vary, and this becomes more apparent when characterizing streamflow behaviour over shorter planning periods. This paper presents a new spell metric that resolves the identified inconsistencies and ensures that the number of high flow spells of varying duration varies in a monotonic manner with the threshold. We retain the usual conceptual basis of high flow spells, but adopt an independence criterion that facilitates their characterization for operational purposes, which is more relevant to ecological functions. The simplicity of the approach allows easy incorporation in decision support tools where identifying high flow spells plays a critical role in making important decisions.},\n\turldate = {2021-05-12},\n\tjournal = {Journal of Ecohydraulics},\n\tauthor = {Kaur, S. and Horne, A. and Stewardson, M. J. and Nathan, R. and Costa, A. M. and Szemis, J. M. and Webb, J. A.},\n\tyear = {2017},\n\tnote = {Publisher: Taylor \\& Francis\n\\_eprint: https://doi.org/10.1080/24705357.2016.1276418},\n\tpages = {28--37},\n\tfile = {Kaur et al. - 2017 - Challenges for determining frequency of high flow .pdf:/Users/alysson/Zotero/storage/95K554JZ/Kaur et al. - 2017 - Challenges for determining frequency of high flow .pdf:application/pdf;Snapshot:/Users/alysson/Zotero/storage/8SVNPZPW/24705357.2016.html:text/html},\n}\n\n

\n

\n\n\n\n\n\n

\n

\n \n 2016\n \n \n (2)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n \n Optimization tools for environmental water decisions: A review of strengths, weaknesses, and opportunities to improve adoption.\n \n \n \n \n\n\n \n Horne, A.; Szemis, J. M.; Kaur, S.; Webb, J. A.; Stewardson, M. J.; Costa, A.; and Boland, N.\n\n\n \n\n\n\n Environmental Modelling & Software, 84: 326–338. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"Optimization$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{horne16optimization,\n\ttitle = {Optimization tools for environmental water decisions: {A} review of strengths, weaknesses, and opportunities to improve adoption},\n\tvolume = {84},\n\tcopyright = {All rights reserved},\n\tissn = {1364-8152},\n\tshorttitle = {Optimization tools for environmental water decisions},\n\turl = {https://www.sciencedirect.com/science/article/pii/S1364815216302936},\n\tdoi = {10.1016/j.envsoft.2016.06.028},\n\tabstract = {Public investment in river restoration through environmental watering has increased substantially in recent years. To sustain public support for such investment, management of environmental water must achieve the best possible outcomes in a transparent and defensible manner. The current management of environmental water relies on the ability of managers to estimate the impacts of their decisions under complex scenarios, often with multiple interdependent decisions that span over different spatial and temporal scales. Optimization modeling has been widely used in other forms of conservation management and an increasing body of literature documents the development of optimization models that could be used to improve environmental water decisions. This paper reviews this disparate research, showing that there are a range of different questions addressed using this modeling approach and that the representation of environmental outcomes varies. Future work must focus on improved adoption through engagement with end users and stakeholders during model development.},\n\tlanguage = {en},\n\turldate = {2021-05-11},\n\tjournal = {Environmental Modelling \\& Software},\n\tauthor = {Horne, A. and Szemis, J. M. and Kaur, S. and Webb, J. A. and Stewardson, M. J. and Costa, A.M. and Boland, N.},\n\tyear = {2016},\n\tpages = {326--338},\n\tfile = {Horne et al. - 2016 - Optimization tools for environmental water decisio.pdf:/Users/alysson/Zotero/storage/SIKTQLAY/Horne et al. - 2016 - Optimization tools for environmental water decisio.pdf:application/pdf},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n The assembly line worker assignment and balancing problem with stochastic worker availability.\n \n \n \n \n\n\n \n Ritt, M.; Costa, A.; and Miralles, C.\n\n\n \n\n\n\n International Journal of Production Research, 54: 907–922. 2016.\n ZSCC: 0000030\n\n\n\n
\n\n\n\n \n \n $\"The$ Link\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{ritt16assembly,\n\ttitle = {The assembly line worker assignment and balancing problem with stochastic worker availability},\n\tvolume = {54},\n\tcopyright = {All rights reserved},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2018/06/draft-ritt15assembly-1jzacgk.pdf},\n\tjournal = {International Journal of Production Research},\n\tauthor = {Ritt, M. and Costa, A.M. and Miralles, C.},\n\tyear = {2016},\n\tnote = {ZSCC: 0000030},\n\tpages = {907--922},\n}\n\n

\n

\n\n\n\n

\n\n\n\n\n\n

\n

\n \n 2015\n \n \n (8)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n \n A new look at the bowl phenomenon.\n \n \n \n \n\n\n \n Castellucci, P.; and Costa, A.\n\n\n \n\n\n\n Pesquisa Operacional, 35: 57–72. 2015.\n ZSCC: 0000006\n\n\n\n
\n\n\n\n \n \n $\"A$ Link\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{castellucci15new,\n\ttitle = {A new look at the bowl phenomenon},\n\tvolume = {35},\n\tcopyright = {All rights reserved},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2018/05/draft-castellucci14new-1p4otz9.pdf},\n\tjournal = {Pesquisa Operacional},\n\tauthor = {Castellucci, P.B. and Costa, A.M.},\n\tyear = {2015},\n\tnote = {ZSCC: 0000006},\n\tpages = {57--72},\n}\n\n

\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sequencing mixed-model assembly lines operating with a heterogeneous workforce.\n \n \n \n \n\n\n \n Cortez, P.; and Costa, A.\n\n\n \n\n\n\n International Journal of Production Research, 53: 3419–3432. 2015.\n ZSCC: 0000027\n\n\n\n
\n\n\n\n \n \n $\"Sequencing$ Link\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{cortez15sequencing,\n\ttitle = {Sequencing mixed-model assembly lines operating with a heterogeneous workforce},\n\tvolume = {53},\n\tcopyright = {All rights reserved},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2018/05/draft-cortez14sequencing-20aw0qw.pdf},\n\tjournal = {International Journal of Production Research},\n\tauthor = {Cortez, P.M.C. and Costa, A.M.},\n\tyear = {2015},\n\tnote = {ZSCC: 0000027},\n\tpages = {3419--3432},\n\tfile = {Cortez and Costa - 2015 - Sequencing mixed-model assembly lines operating wi.pdf:/Users/alysson/Zotero/storage/93NPC5A9/Cortez and Costa - 2015 - Sequencing mixed-model assembly lines operating wi.pdf:application/pdf},\n}\n\n

\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n Developing a seasonal environmental watering tool.\n \n \n \n\n\n \n Horne, A.; Costa, A. M.; Boland, N.; Kaur, S.; Szemis, J.; and Stewardson, M.\n\n\n \n\n\n\n In The Art and Science of Water - 36th Hydrology and Water Resources Symposium, HWRS 2015, pages 907–914, 2015. \n ZSCC: 0000000\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n

\n

@inproceedings{horne15developing,\n\ttitle = {Developing a seasonal environmental watering tool},\n\tcopyright = {All rights reserved},\n\tbooktitle = {The {Art} and {Science} of {Water} - 36th {Hydrology} and {Water} {Resources} {Symposium}, {HWRS} 2015},\n\tauthor = {Horne, A. and Costa, A. M. and Boland, N. and Kaur, S. and Szemis, J. and Stewardson, M.},\n\tyear = {2015},\n\tnote = {ZSCC: 0000000},\n\tkeywords = {society},\n\tpages = {907--914},\n}\n\n

\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Robust assembly line balancing with heterogeneous workers.\n \n \n \n \n\n\n \n Moreira, M. C. O.; Cordeau, J.; Costa, A. M.; and Laporte, G.\n\n\n \n\n\n\n Computers & Industrial Engineering, 88: 254–263. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Robust$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{moreira15robust,\n\ttitle = {Robust assembly line balancing with heterogeneous workers},\n\tvolume = {88},\n\tcopyright = {All rights reserved},\n\tissn = {0360-8352},\n\turl = {https://www.sciencedirect.com/science/article/pii/S0360835215003058},\n\tdoi = {10.1016/j.cie.2015.07.004},\n\tabstract = {Assembly lines are manufacturing systems in which a product is assembled progressively in workstations by different workers or machines, each executing a subset of the needed assembly operations (or tasks). We consider the case in which task execution times are worker-dependent and uncertain, being expressed as intervals of possible values. Our goal is to find an assignment of tasks and workers to a minimal number of stations such that the resulting productivity level respects a desired robust measure. We propose two mixed-integer programming formulations for this problem and explain how these formulations can be adapted to handle the special case in which one must integrate a particular set of workers in the assembly line. We also present a fast construction heuristic that yields high quality solutions in just a fraction of the time needed to solve the problem to optimality. Computational results show the benefits of solving the robust optimization problem instead of its deterministic counterpart.},\n\tlanguage = {en},\n\turldate = {2021-05-10},\n\tjournal = {Computers \\& Industrial Engineering},\n\tauthor = {Moreira, M. C. O. and Cordeau, J.-F. and Costa, A. M. and Laporte, G.},\n\tyear = {2015},\n\tpages = {254--263},\n\tfile = {Moreira et al. - 2015 - Robust assembly line balancing with heterogeneous .pdf:/Users/alysson/Zotero/storage/T4YWK4ZN/Moreira et al. - 2015 - Robust assembly line balancing with heterogeneous .pdf:application/pdf},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Model and heuristics for the Assembly Line Worker Integration and Balancing Problem.\n \n \n \n \n\n\n \n Moreira, M. C. O.; Miralles, C.; and Costa, A. M.\n\n\n \n\n\n\n Computers & Operations Research, 54: 64–73. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Model$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{moreira15model,\n\ttitle = {Model and heuristics for the {Assembly} {Line} {Worker} {Integration} and {Balancing} {Problem}},\n\tvolume = {54},\n\tcopyright = {All rights reserved},\n\tissn = {0305-0548},\n\turl = {https://www.sciencedirect.com/science/article/pii/S0305054814002317},\n\tdoi = {10.1016/j.cor.2014.08.021},\n\tabstract = {We propose the Assembly Line Worker Integration and Balancing Problem (ALWIBP), a new assembly line balancing problem arising in lines with conventional and disabled workers. The goal of this problem is to maintain high productivity levels by minimizing the number of workstations needed to reach a given output, while integrating in the assembly line a number of disabled workers. Being able to efficiently manage a heterogeneous workforce is especially important in the current social context where companies are urged to integrate workers with different profiles. In this paper we present mathematical models and heuristic methodologies that can help assembly line managers to cope with this additional complexity. We demonstrate by means of a robust benchmark how this integration can be done with losses of productivity that are much lower than expected.},\n\tlanguage = {en},\n\turldate = {2021-05-10},\n\tjournal = {Computers \\& Operations Research},\n\tauthor = {Moreira, M. C. O. and Miralles, C. and Costa, A. M.},\n\tyear = {2015},\n\tpages = {64--73},\n\tfile = {Moreira et al. - 2015 - Model and heuristics for the Assembly Line Worker .pdf:/Users/alysson/Zotero/storage/DG8T8Y4B/Moreira et al. - 2015 - Model and heuristics for the Assembly Line Worker .pdf:application/pdf},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes.\n \n \n \n \n\n\n \n Santos, L. M. R.; Munari, P.; Costa, A. M.; and Santos, R. H. S.\n\n\n \n\n\n\n European Journal of Operational Research, 245: 581–590. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{santos15branchpriceandcut,\n\ttitle = {A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes},\n\tvolume = {245},\n\tcopyright = {All rights reserved},\n\tissn = {0377-2217},\n\turl = {https://www.sciencedirect.com/science/article/pii/S0377221715002428},\n\tdoi = {10.1016/j.ejor.2015.03.035},\n\tabstract = {Crop rotation plays an important role in agricultural production models with sustainability considerations. Commonly associated strategies include the alternation of botanical families in the plots, the use of fallow periods and the inclusion of green manure crops. In this article, we address the problem of scheduling vegetable production in this context. Vegetables crop farmers usually manage a large number of crop species with different planting periods and growing times. These crops present multiple and varied harvesting periods and productivities. The combination of such characteristics makes the generation of good vegetable crop rotation schedules a hard combinatorial task. We approach this problem while considering two additional important practical aspects: standard plot sizes (multiples of a base area) and total area minimisation. We propose an integer programming formulation for this problem and develop a branch-price-and-cut algorithm that includes several performance-enhancing characteristics, such as the inclusion of a family of subadditive valid inequalities, two primal heuristics and a strong branching rule. Extensive computational experiments over a set of instances based on real-life data validate the efficiency and robustness of the proposed method.},\n\tlanguage = {en},\n\turldate = {2021-05-10},\n\tjournal = {European Journal of Operational Research},\n\tauthor = {Santos, L. M. R. and Munari, P. and Costa, A. M. and Santos, R. H. S.},\n\tyear = {2015},\n\tpages = {581--590},\n\tfile = {Santos et al. - 2015 - A branch-price-and-cut method for the vegetable cr.pdf:/Users/alysson/Zotero/storage/U6CGKDED/Santos et al. - 2015 - A branch-price-and-cut method for the vegetable cr.pdf:application/pdf;ScienceDirect Snapshot:/Users/alysson/Zotero/storage/IJUYU25F/S0377221715002428.html:text/html},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A hybrid path-relinking method for solving two-stage stochastic integer problems.\n \n \n \n \n\n\n \n Amorim, P.; Costa, A. M.; and Almada‐Lobo, B.\n\n\n \n\n\n\n International Transactions in Operational Research, 22: 113–127. 2015.\n _eprint: https://onlinelibrary.wiley.com/doi/pdf/10.1111/itor.12084\n\n\n\n
\n\n\n\n \n \n $\"A$ Link\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{amorim15hybrid,\n\ttitle = {A hybrid path-relinking method for solving two-stage stochastic integer problems},\n\tvolume = {22},\n\tcopyright = {© 2014 The Authors. International Transactions in Operational Research © 2014 International Federation of Operational Research Societies Published by John Wiley \\& Sons Ltd, 9600 Garsington Road, Oxford OX4 2DQ, UK and 350 Main St, Malden, MA02148, USA.},\n\tissn = {1475-3995},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2018/05/draft-amorim14hybrid-ycbnp4.pdf},\n\tdoi = {https://doi.org/10.1111/itor.12084},\n\tabstract = {Path relinking has been used for solving deterministic problems by exploring the neighborhood of elite solutions in an intelligent way. We present an algorithm that combines a mixed-integer linear solver with a truncated path-relinking method in order to solve two-stage stochastic integer problems with complete recourse and first-stage integer variables. This method takes advantage of a possible scenario-based decomposition in an innovative way. Therefore, path relinking is used to combine optimized solutions from different scenarios in order to pursue good stochastic solutions. To assess the computational performance of this method, we use the stochastic lot sizing and scheduling problem dealing with perishable products. In this problem, first-stage decision variables are linked to production sequences and production quantities. After the uncertain demand is unveiled, the second-stage variables decide on the inventory usage. Computational results show a clear advantage of the proposed method when compared to a state-of-the-art mixed-integer linear solver.},\n\tlanguage = {en},\n\turldate = {2021-05-11},\n\tjournal = {International Transactions in Operational Research},\n\tauthor = {Amorim, P. and Costa, A. M. and Almada‐Lobo, B.},\n\tyear = {2015},\n\tnote = {\\_eprint: https://onlinelibrary.wiley.com/doi/pdf/10.1111/itor.12084},\n\tpages = {113--127},\n\tfile = {Snapshot:/Users/alysson/Zotero/storage/5R847QPD/itor.html:text/html},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Balancing parallel assembly lines with disabled workers.\n \n \n \n \n\n\n \n Araújo, F.; Costa, A.; and Miralles, C.\n\n\n \n\n\n\n European Journal of Industrial Engineering, 9: 344–365. 2015.\n ZSCC: NoCitationData[s0]\n\n\n\n
\n\n\n\n \n \n $\"Balancing$ Link\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{araujo15balancing,\n\ttitle = {Balancing parallel assembly lines with disabled workers},\n\tvolume = {9},\n\tcopyright = {All rights reserved},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2018/05/draft-araujo13balancing-2bstza4.pdf},\n\tabstract = {In this paper, we study an assembly line balancing problem that occurs in sheltered worker centres for the disabled, where workers with very different characteristics are present. We are interested in the situation in which complete parallel assembly lines are allowed and name the resulting problem as parallel assembly line worker assignment and balancing problem (PALWABP). This approach enables many new possible worker-tasks assignments, what is beneficial in terms of both labour integration and productivity. We present a linear mixed-integer formulation and two heuristic solution methods: one is based on tabu search and the other is a biased random-key genetic algorithm (BRKGA). Computational results with a large set of instances recently proposed in the literature show the advantages of allowing such alternative line layouts. [Received 6 November 2013; Revised 14 February 2014; Accepted 26 March 2014]},\n\tjournal = {European Journal of Industrial Engineering},\n\tauthor = {Araújo, F.F.B. and Costa, A.M. and Miralles, C.},\n\tyear = {2015},\n\tnote = {ZSCC: NoCitationData[s0]},\n\tpages = {344--365},\n\tfile = {Araújo et al. - 2015 - Balancing parallel assembly lines with disabled wo.pdf:/Users/alysson/Zotero/storage/MJII7RSN/Araújo et al. - 2015 - Balancing parallel assembly lines with disabled wo.pdf:application/pdf},\n}\n\n

\n

\n\n\n\n\n\n

\n

\n \n 2014\n \n \n (2)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n \n Sustainable vegetable crop supply problem with perishable stocks.\n \n \n \n \n\n\n \n Costa, A. M.; Santos, L. M. R.; Alem, D. J.; and Santos, R. H. S.\n\n\n \n\n\n\n Annals of Operations Research, 219: 265–283. 2014.\n \n\n\n\n
\n\n\n\n \n \n $\"Sustainable$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{costa_sustainable_2014,\n\ttitle = {Sustainable vegetable crop supply problem with perishable stocks},\n\tvolume = {219},\n\tcopyright = {All rights reserved},\n\tissn = {1572-9338},\n\turl = {https://doi.org/10.1007/s10479-010-0830-y},\n\tdoi = {10.1007/s10479-010-0830-y},\n\tabstract = {In this paper, we deal with a vegetable crop supply problem with two main particularities: (i) the production must respect certain ecologically-based constraints and (ii) harvested crops can be stocked but only for a limited period of time, given that they are perishable. To model these characteristics, we develop a linear formulation in which each variable is associated to a crop rotation plan. This model contains a very large number of variables and is therefore solved with the aid of a column generation approach. Moreover, we also propose a two-stage stochastic programming with recourse model which takes into consideration that information on the demands might be uncertain. We provide a discussion of the results obtained via computational tests run on instances adapted from real-world data.},\n\tlanguage = {en},\n\turldate = {2021-05-12},\n\tjournal = {Annals of Operations Research},\n\tauthor = {Costa, A. M. and Santos, L. Mara R. and Alem, D. J. and Santos, R. H. S.},\n\tyear = {2014},\n\tpages = {265--283},\n\tfile = {Costa et al. - 2014 - Sustainable vegetable crop supply problem with per.pdf:/Users/alysson/Zotero/storage/WGVZF8HL/Costa et al. - 2014 - Sustainable vegetable crop supply problem with per.pdf:application/pdf},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Influence of consumer purchasing behaviour on the production planning of perishable food.\n \n \n \n \n\n\n \n Amorim, P.; Costa, A. M.; and Almada-Lobo, B.\n\n\n \n\n\n\n OR Spectrum, 36: 669–692. 2014.\n \n\n\n\n
\n\n\n\n \n \n $\"Influence$ Link\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{amorim14influence,\n\ttitle = {Influence of consumer purchasing behaviour on the production planning of perishable food},\n\tvolume = {36},\n\tcopyright = {All rights reserved},\n\tissn = {1436-6304},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2022/02/Amorim-Costa-Almada-Lobo-2014-OR-Spectrum-annotated.pdf},\n\tdoi = {10.1007/s00291-013-0324-9},\n\tabstract = {This paper addresses the impact of consumer purchasing behaviour on the production planning of perishable food products for companies operating in the fast moving consumer goods using direct store delivery. The research presented here builds on previous marketing studies related to the effects of expiry dates in order to derive mathematical formulae, which express the age dependent demand for different categories of perishable products. These demand expressions take into account both customer willingness to pay and product quality risk. The paper presents deterministic and stochastic production planning models, which incorporate the customer’s eagerness to pick up the fresher products available. Results indicate that model approximations neglecting the fact that customers pick up the fresher products or considering that all products have the same product quality risk have a reduced impact on profit losses. On the other hand, not considering the decreasing customer willingness to pay has an important impact both on the profit losses and on the amount of spoiled products.},\n\tlanguage = {en},\n\turldate = {2021-05-11},\n\tjournal = {OR Spectrum},\n\tauthor = {Amorim, P. and Costa, A. M. and Almada-Lobo, B.},\n\tyear = {2014},\n\tpages = {669--692},\n\tfile = {Amorim et al. - 2014 - Influence of consumer purchasing behaviour on the .pdf:/Users/alysson/Zotero/storage/MUHSJYFM/Amorim et al. - 2014 - Influence of consumer purchasing behaviour on the .pdf:application/pdf},\n}\n\n

\n

\n\n\n\n\n\n

\n

\n \n 2013\n \n \n (1)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n \n Hybrid heuristics for planning job rotation schedules in assembly lines with heterogeneous workers.\n \n \n \n \n\n\n \n Moreira, M. C. O.; and Costa, A. M.\n\n\n \n\n\n\n International Journal of Production Economics, 141: 552–560. 2013.\n \n\n\n\n
\n\n\n\n \n \n $\"Hybrid$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{moreira13hybrid,\n\tseries = {Special {Issue} on {Service} {Science}},\n\ttitle = {Hybrid heuristics for planning job rotation schedules in assembly lines with heterogeneous workers},\n\tvolume = {141},\n\tcopyright = {All rights reserved},\n\tissn = {0925-5273},\n\turl = {https://www.sciencedirect.com/science/article/pii/S0925527312004070},\n\tdoi = {10.1016/j.ijpe.2012.09.011},\n\tabstract = {We investigate the problem of balancing assembly lines with heterogeneous workers while considering job rotation schedules. This problem typically occurs in assembly lines in sheltered work centers for disabled. We propose a hybrid algorithm that uses a Mixed Integer Programming (MIP) to select appropriate schedules from a pool of heuristically constructed solutions. A local search based on MIP neighborhoods is used as a post-optimization method. Our results show that this approach is fast, flexible and accurate when compared with current available methods.},\n\tlanguage = {en},\n\turldate = {2021-05-10},\n\tjournal = {International Journal of Production Economics},\n\tauthor = {Moreira, M. C. O. and Costa, A. M.},\n\tyear = {2013},\n\tpages = {552--560},\n\tfile = {ScienceDirect Full Text PDF:/Users/alysson/Zotero/storage/K7A4UBZB/Moreira and Costa - 2013 - Hybrid heuristics for planning job rotation schedu.pdf:application/pdf},\n}\n\n

\n

\n\n\n\n\n\n

\n

\n \n 2012\n \n \n (3)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n \n Two extensions for the ALWABP: Parallel stations and collaborative approach.\n \n \n \n \n\n\n \n Araújo, F. F. B.; Costa, A. M.; and Miralles, C.\n\n\n \n\n\n\n International Journal of Production Economics, 140: 483–495. 2012.\n \n\n\n\n
\n\n\n\n \n \n $\"Two$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{araujo12two,\n\tseries = {Sustainable {Development} of {Manufacturing} and {Services}},\n\ttitle = {Two extensions for the {ALWABP}: {Parallel} stations and collaborative approach},\n\tvolume = {140},\n\tcopyright = {All rights reserved},\n\tissn = {0925-5273},\n\tshorttitle = {Two extensions for the {ALWABP}},\n\turl = {https://www.sciencedirect.com/science/article/pii/S0925527312002770},\n\tdoi = {10.1016/j.ijpe.2012.06.032},\n\tabstract = {In this article, we introduce two new variants of the Assembly Line Worker Assignment and Balancing Problem (ALWABP) that allow parallelization of and collaboration between heterogeneous workers. These new approaches suppose an additional level of complexity in the Line Design and Assignment process, but also higher flexibility; which may be particularly useful in practical situations where the aim is to progressively integrate slow or limited workers in conventional assembly lines. We present linear models and heuristic procedures for these two new problems. Computational results show the efficiency of the proposed approaches and the efficacy of the studied layouts in different situations.},\n\tlanguage = {en},\n\turldate = {2021-05-11},\n\tjournal = {International Journal of Production Economics},\n\tauthor = {Araújo, F. F. B. and Costa, A. M. and Miralles, C.},\n\tyear = {2012},\n\tpages = {483--495},\n\tfile = {Araújo et al. - 2012 - Two extensions for the ALWABP Parallel stations a.pdf:/Users/alysson/Zotero/storage/WVUK36PY/Araújo et al. - 2012 - Two extensions for the ALWABP Parallel stations a.pdf:application/pdf;ScienceDirect Snapshot:/Users/alysson/Zotero/storage/TX5XMJID/S0925527312002770.html:text/html},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Simple heuristics for the assembly line worker assignment and balancing problem.\n \n \n \n \n\n\n \n Moreira, M. C. O.; Ritt, M.; Costa, A. M.; and Chaves, A. A.\n\n\n \n\n\n\n Journal of Heuristics, 18: 505–524. 2012.\n \n\n\n\n
\n\n\n\n \n \n $\"Simple$ Link\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{moreira12simple,\n\ttitle = {Simple heuristics for the assembly line worker assignment and balancing problem},\n\tvolume = {18},\n\tcopyright = {All rights reserved},\n\tissn = {1572-9397},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2018/05/draft-moreira10simple-1nyp7mc.pdf},\n\tdoi = {10.1007/s10732-012-9195-5},\n\tabstract = {We propose simple heuristics for the assembly line worker assignment and balancing problem. This problem typically occurs in assembly lines in sheltered work centers for the disabled. Different from the well-known simple assembly line balancing problem, the task execution times vary according to the assigned worker. We develop a constructive heuristic framework based on task and worker priority rules defining the order in which the tasks and workers should be assigned to the workstations. We present a number of such rules and compare their performance across three possible uses: as a stand-alone method, as an initial solution generator for meta-heuristics, and as a decoder for a hybrid genetic algorithm. Our results show that the heuristics are fast, they obtain good results as a stand-alone method and are efficient when used as a initial solution generator or as a solution decoder within more elaborate approaches.},\n\tlanguage = {en},\n\turldate = {2021-05-10},\n\tjournal = {Journal of Heuristics},\n\tauthor = {Moreira, M. C. O. and Ritt, M. and Costa, A. M. and Chaves, A. A.},\n\tyear = {2012},\n\tpages = {505--524},\n\tfile = {Moreira et al. - 2012 - Simple heuristics for the assembly line worker ass.pdf:/Users/alysson/Zotero/storage/FS359PJR/Moreira et al. - 2012 - Simple heuristics for the assembly line worker ass.pdf:application/pdf},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Accelerating benders decomposition with heuristic master problem solutions.\n \n \n \n \n\n\n \n Costa, A. M.; Cordeau, J.; Gendron, B.; and Laporte, G.\n\n\n \n\n\n\n Pesquisa Operacional, 32: 03–20. 2012.\n \n\n\n\n
\n\n\n\n \n \n $\"Accelerating$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{costa12accelerating,\n\ttitle = {Accelerating benders decomposition with heuristic master problem solutions},\n\tvolume = {32},\n\tcopyright = {All rights reserved},\n\tissn = {0101-7438},\n\turl = {http://www.scielo.br/scielo.php?script=sci_abstract&pid=S0101-74382012000100002&lng=en&nrm=iso&tlng=en},\n\tdoi = {10.1590/S0101-74382012005000005},\n\tabstract = {In this paper, a general scheme for generating extra cuts during the execution of a Benders decomposition algorithm is presented. These cuts are based on feasible and infeasible master problem solutions generated by means of a heuristic. This article includes general guidelines and a case study with a fixed charge network design problem. Computational tests with instances of this problem show the efficiency of the strategy. The most important aspect of the proposed ideas is their generality, which allows them to be used in virtually any Benders decomposition implementation.},\n\tlanguage = {en},\n\turldate = {2021-05-12},\n\tjournal = {Pesquisa Operacional},\n\tauthor = {Costa, A. M. and Cordeau, J.-F. and Gendron, B. and Laporte, G.},\n\tyear = {2012},\n\tpages = {03--20},\n\tfile = {Costa et al. - 2012 - Accelerating benders decomposition with heuristicm.pdf:/Users/alysson/Zotero/storage/S9T56X5E/Costa et al. - 2012 - Accelerating benders decomposition with heuristicm.pdf:application/pdf;Snapshot:/Users/alysson/Zotero/storage/42HBLND2/scielo.html:text/html},\n}\n\n

\n

\n\n\n\n\n\n

\n

\n \n 2011\n \n \n (1)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n Two-level network design with intermediate facilities: An application to electrical distribution systems.\n \n \n \n\n\n \n Costa, A.; Franca, P. M.; and Lyra Filho, C.\n\n\n \n\n\n\n Omega, 39: 3–13. 2011.\n ZSCC: 0000061\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{costa11twolevel,\n\ttitle = {Two-level network design with intermediate facilities: {An} application to electrical distribution systems},\n\tvolume = {39},\n\tcopyright = {All rights reserved},\n\tjournal = {Omega},\n\tauthor = {Costa, A.M. and Franca, P. M. and Lyra Filho, C.},\n\tyear = {2011},\n\tnote = {ZSCC: 0000061},\n\tpages = {3--13},\n\tfile = {Costa et al. - 2011 - Two-level network design with intermediate facilit.pdf:/Users/alysson/Zotero/storage/MC6N9T7H/Costa et al. - 2011 - Two-level network design with intermediate facilit.pdf:application/pdf},\n}\n\n

\n

\n\n\n\n

\n\n\n\n\n\n

\n

\n \n 2010\n \n \n (3)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n \n Operations research/management science tools for integrating people with disabilities into employment. A study on Valencia's Sheltered Work Centres for Disabled.\n \n \n \n \n\n\n \n Miralles, C.; Marin‐Garcia, J. A.; Ferrus, G.; and Costa, A. M.\n\n\n \n\n\n\n International Transactions in Operational Research, 17: 457–473. 2010.\n _eprint: https://onlinelibrary.wiley.com/doi/pdf/10.1111/j.1475-3995.2009.00727.x\n\n\n\n
\n\n\n\n \n \n $\"Operations$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{miralles10operations,\n\ttitle = {Operations research/management science tools for integrating people with disabilities into employment. {A} study on {Valencia}'s {Sheltered} {Work} {Centres} for {Disabled}},\n\tvolume = {17},\n\tcopyright = {© 2010 The Authors. Journal compilation © 2010 International Federation of Operational Research Societies},\n\tissn = {1475-3995},\n\turl = {https://onlinelibrary.wiley.com/doi/abs/10.1111/j.1475-3995.2009.00727.x},\n\tdoi = {https://doi.org/10.1111/j.1475-3995.2009.00727.x},\n\tabstract = {People with disabilities have a right to a full life in every sense and one of those fundamental rights is the possibility to work. In this paper, the importance of social employment integration of disabled people is highlighted as one of the stakeholders to be satisfied by companies in the new framework that corporate social responsibility is constructing. The objective of the paper is to revise the benefits of some well-known operations research/management science tools that, if applied correctly, have a double positive impact on work accessibility and improved productivity. The responses collected from managers of Valencia's Sheltered Work Centres for Disabled by means of a structured questionnaire are used to analyse the level of implementation of these tools and their impact depending on the type of centre, the kind of disability and other structural variables.},\n\tlanguage = {en},\n\turldate = {2021-05-10},\n\tjournal = {International Transactions in Operational Research},\n\tauthor = {Miralles, C. and Marin‐Garcia, J. A. and Ferrus, G. and Costa, A. M.},\n\tyear = {2010},\n\tnote = {\\_eprint: https://onlinelibrary.wiley.com/doi/pdf/10.1111/j.1475-3995.2009.00727.x},\n\tpages = {457--473},\n\tfile = {Miralles et al. - 2010 - Operations researchmanagement science tools for i.pdf:/Users/alysson/Zotero/storage/7AHIN25B/Miralles et al. - 2010 - Operations researchmanagement science tools for i.pdf:application/pdf;Snapshot:/Users/alysson/Zotero/storage/PMM7MVCV/j.1475-3995.2009.00727.html:text/html},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sustainable vegetable crop supply problem.\n \n \n \n \n\n\n \n Santos, L. M.; Costa, A. M.; Arenales, M. N.; and Santos, R. H. S.\n\n\n \n\n\n\n European Journal of Operational Research, 204: 639–647. 2010.\n \n\n\n\n
\n\n\n\n \n \n $\"Sustainable$ Link\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{santos10sustainable,\n\ttitle = {Sustainable vegetable crop supply problem},\n\tvolume = {204},\n\tcopyright = {All rights reserved},\n\tissn = {0377-2217},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2018/05/draft-santos10sustainable-1il92ou.pdf},\n\tdoi = {10.1016/j.ejor.2009.11.026},\n\tabstract = {We consider an agricultural production problem, in which one must meet a known demand of crops while respecting ecologically-based production constraints. The problem is twofold: in order to meet the demand, one must determine the division of the available heterogeneous arable areas in plots and, for each plot, obtain an appropriate crop rotation schedule. Rotation plans must respect ecologically-based constraints such as the interdiction of certain crop successions, and the regular insertion of fallows and green manures. We propose a linear formulation for this problem, in which each variable is associated with a crop rotation schedule. The model may include a large number of variables and it is, therefore, solved by means of a column-generation approach. We also discuss some extensions to the model, in order to incorporate additional characteristics found in field conditions. A set of computational tests using instances based on real-world data confirms the efficacy of the proposed methodology.},\n\tlanguage = {en},\n\turldate = {2021-05-10},\n\tjournal = {European Journal of Operational Research},\n\tauthor = {Santos, L. M. and Costa, A. M. and Arenales, M. N. and Santos, R. H. S.},\n\tyear = {2010},\n\tpages = {639--647},\n\tfile = {dos Santos et al. - 2010 - Sustainable vegetable crop supply problem.pdf:/Users/alysson/Zotero/storage/YGGP4RCX/dos Santos et al. - 2010 - Sustainable vegetable crop supply problem.pdf:application/pdf;ScienceDirect Snapshot:/Users/alysson/Zotero/storage/AHZJIE76/S0377221709008996.html:text/html},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n A linear optimization approach for increasing sustainability in vegetable crop production.\n \n \n \n\n\n \n Santos, L.; Arenales, M.; Costa, A.; and Santos, R.\n\n\n \n\n\n\n In Slyke, C. V., editor(s), Computational Methods for Agricultural Research: Advances and Applications, pages 234–265. 2010.\n ZSCC: NoCitationData[s0]\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@incollection{santos10linear,\n\ttitle = {A linear optimization approach for increasing sustainability in vegetable crop production},\n\tcopyright = {All rights reserved},\n\tbooktitle = {Computational {Methods} for {Agricultural} {Research}: {Advances} and {Applications}},\n\tauthor = {Santos, L.M.R. and Arenales, M.N. and Costa, A.M. and Santos, R.H.S.},\n\teditor = {Slyke, Craig Van},\n\tyear = {2010},\n\tnote = {ZSCC: NoCitationData[s0]},\n\tpages = {234--265},\n}\n\n

\n

\n\n\n\n

\n\n\n\n\n\n

\n

\n \n 2009\n \n \n (4)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n An integer linear programming approach for approximate string comparison.\n \n \n \n\n\n \n Ritt, M.; Costa, A.; Mergen, S.; and Orengo, V.\n\n\n \n\n\n\n European Journal of Operational Research, 198: 706–714. 2009.\n ZSCC: 0000007\n\n\n\n
\n\n\n\n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{ritt09integer,\n\ttitle = {An integer linear programming approach for approximate string comparison},\n\tvolume = {198},\n\tcopyright = {All rights reserved},\n\tdoi = {doi.org/10.1016/j.ejor.2008.10.013},\n\tjournal = {European Journal of Operational Research},\n\tauthor = {Ritt, M. and Costa, A.M. and Mergen, S. and Orengo, V.M.},\n\tyear = {2009},\n\tnote = {ZSCC: 0000007},\n\tpages = {706--714},\n}\n\n

\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n Benders, metric and cutset inequalities for multicommodity capacitated network design.\n \n \n \n\n\n \n Costa, A. M.; Cordeau, J.; and Gendron, B.\n\n\n \n\n\n\n Computational Optimization and Applications, 42: 371–392. 2009.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{costa09benders,\n\ttitle = {Benders, metric and cutset inequalities for multicommodity capacitated network design},\n\tvolume = {42},\n\tcopyright = {All rights reserved},\n\tissn = {1573-2894},\n\tdoi = {10.1007/s10589-007-9122-0},\n\tabstract = {Solving multicommodity capacitated network design problems is a hard task that requires the use of several strategies like relaxing some constraints and strengthening the model with valid inequalities. In this paper, we compare three sets of inequalities that have been widely used in this context: Benders, metric and cutset inequalities. We show that Benders inequalities associated to extreme rays are metric inequalities. We also show how to strengthen Benders inequalities associated to non-extreme rays to obtain metric inequalities. We show that cutset inequalities are Benders inequalities, but not necessarily metric inequalities. We give a necessary and sufficient condition for a cutset inequality to be a metric inequality. Computational experiments show the effectiveness of strengthening Benders and cutset inequalities to obtain metric inequalities.},\n\tlanguage = {en},\n\turldate = {2021-05-10},\n\tjournal = {Computational Optimization and Applications},\n\tauthor = {Costa, A. M. and Cordeau, J.-F. and Gendron, B.},\n\tyear = {2009},\n\tpages = {371--392},\n\tfile = {Costa et al. - 2009 - Benders, metric and cutset inequalities for multic.pdf:/Users/alysson/Zotero/storage/XU4WXNZF/Costa et al. - 2009 - Benders, metric and cutset inequalities for multic.pdf:application/pdf},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints.\n \n \n \n\n\n \n Costa, A. M.; Cordeau, J.; and Laporte, G.\n\n\n \n\n\n\n Networks: An International Journal, 53: 141–159. 2009.\n ZSCC: 0000060 tex.ids= costa09modelsa publisher: Wiley Online Library\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{costa09models,\n\ttitle = {Models and branch-and-cut algorithms for the {Steiner} tree problem with revenues, budget and hop constraints},\n\tvolume = {53},\n\tcopyright = {All rights reserved},\n\tjournal = {Networks: An International Journal},\n\tauthor = {Costa, A. M. and Cordeau, J.-F. and Laporte, G.},\n\tyear = {2009},\n\tnote = {ZSCC: 0000060 \ntex.ids= costa09modelsa\npublisher: Wiley Online Library},\n\tpages = {141--159},\n\tfile = {Costa et al. - 2009 - Models and branch-and-cut algorithms for the Stein.pdf:/Users/alysson/Zotero/storage/9ELNNLDM/Costa et al. - 2009 - Models and branch-and-cut algorithms for the Stein.pdf:application/pdf;Snapshot:/Users/alysson/Zotero/storage/MGJWCLPQ/net.html:text/html},\n}\n\n

\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n Job rotation in assembly lines employing disabled workers.\n \n \n \n\n\n \n Costa, A. M.; and Miralles, C.\n\n\n \n\n\n\n International Journal of Production Economics, 120: 625–632. 2009.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{costa09job,\n\tseries = {Special {Issue} on {Introduction} to {Design} and {Analysis} of {Production} {Systems}},\n\ttitle = {Job rotation in assembly lines employing disabled workers},\n\tvolume = {120},\n\tcopyright = {All rights reserved},\n\tissn = {0925-5273},\n\tdoi = {10.1016/j.ijpe.2009.04.013},\n\tabstract = {In this paper we consider the programming of job rotation in the assembly line worker assignment and balancing problem. The motivation for this study comes from the designing of assembly lines in sheltered work centers for the disabled, where workers have different task execution times. In this context, the well-known training aspects associated with job rotation are particularly desired. We propose a metric along with a mixed integer linear model and a heuristic decomposition method to solve this new job rotation problem. Computational results show the efficacy of the proposed heuristics.},\n\tlanguage = {en},\n\turldate = {2021-05-10},\n\tjournal = {International Journal of Production Economics},\n\tauthor = {Costa, A. M. and Miralles, C.},\n\tyear = {2009},\n\tpages = {625--632},\n\tfile = {ScienceDirect Full Text PDF:/Users/alysson/Zotero/storage/UX3B5MI3/Costa and Miralles - 2009 - Job rotation in assembly lines employing disabled .pdf:application/pdf;ScienceDirect Snapshot:/Users/alysson/Zotero/storage/XT9GKVV4/S0925527309001224.html:text/html},\n}\n\n

\n

\n\n\n\n\n\n

\n

\n \n 2008\n \n \n (2)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n \n Optimization of the Physical Refining of Sunflower Oil Concerning the Final Contents of trans-Fatty Acids.\n \n \n \n \n\n\n \n Ceriani, R.; Costa, A. M.; and Meirelles, A. J. A.\n\n\n \n\n\n\n Industrial & Engineering Chemistry Research, 47: 681–692. 2008.\n Publisher: American Chemical Society\n\n\n\n
\n\n\n\n \n \n $\"Optimization$ Link\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{ceriani08optimization,\n\ttitle = {Optimization of the {Physical} {Refining} of {Sunflower} {Oil} {Concerning} the {Final} {Contents} of trans-{Fatty} {Acids}},\n\tvolume = {47},\n\tcopyright = {All rights reserved},\n\tissn = {0888-5885},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2018/06/draft-ceriani08optimization-1ohezkh.pdf},\n\tdoi = {10.1021/ie070118p},\n\tabstract = {The final contents of total and individual trans-fatty acids of sunflower oil, produced during the deacidification step of physical refining were obtained using a computational simulation program that considered cis−trans isomerization reaction features for oleic, linoleic, and linolenic acids attached to the glycerol part of triacylglycerols. The impact of process variables, such as temperature and liquid flow rate, and of equipment configuration parameters, such as liquid height, diameter, and number of stages, that influence the retention time of the oil in the equipment was analyzed using the response-surface methodology (RSM). The computational simulation and the RSM results were used in two different optimization methods, aiming to minimize final levels of total and individual trans-fatty acids (trans-FA), while keeping neutral oil loss and final oil acidity at low values. The main goal of this work was to indicate that computational simulation, based on a careful modeling of the reaction system, combined with optimization could be an important tool for indicating better processing conditions in industrial physical refining plants of vegetable oils, concerning trans-FA formation.},\n\turldate = {2021-05-12},\n\tjournal = {Industrial \\& Engineering Chemistry Research},\n\tauthor = {Ceriani, R. and Costa, A. M. and Meirelles, A. J. A.},\n\tyear = {2008},\n\tnote = {Publisher: American Chemical Society},\n\tpages = {681--692},\n\tfile = {ACS Full Text Snapshot:/Users/alysson/Zotero/storage/FRZAUPNP/ie070118p.html:text/html;Ceriani et al. - 2008 - Optimization of the physical refining of sunflower.pdf:/Users/alysson/Zotero/storage/5ZDXE4UN/Ceriani et al. - 2008 - Optimization of the physical refining of sunflower.pdf:application/pdf},\n}\n\n

\n

\n\n\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints.\n \n \n \n \n\n\n \n Costa, A. M.; Cordeau, J.; and Laporte, G.\n\n\n \n\n\n\n European Journal of Operational Research, 190: 68–78. 2008.\n \n\n\n\n
\n\n\n\n \n \n $\"Fast$ Link\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{costa08fast,\n\ttitle = {Fast heuristics for the {Steiner} tree problem with revenues, budget and hop constraints},\n\tvolume = {190},\n\tcopyright = {All rights reserved},\n\tissn = {0377-2217},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2018/06/draft-costa08fast-1zmc1l4.pdf},\n\tdoi = {10.1016/j.ejor.2007.06.012},\n\tabstract = {This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method which obtains good approximations in short computational times is proposed. This initial solution is then improved by means of a destroy-and-repair method or a tabu search algorithm. Computational results compare the three methods in terms of accuracy and speed.},\n\tlanguage = {en},\n\turldate = {2021-05-12},\n\tjournal = {European Journal of Operational Research},\n\tauthor = {Costa, A. M. and Cordeau, J.-F. and Laporte, G.},\n\tyear = {2008},\n\tpages = {68--78},\n\tfile = {Costa et al. - 2008 - Fast heuristics for the Steiner tree problem with .pdf:/Users/alysson/Zotero/storage/4GH3NVBI/Costa et al. - 2008 - Fast heuristics for the Steiner tree problem with .pdf:application/pdf},\n}\n\n

\n

\n\n\n\n\n\n

\n

\n \n 2006\n \n \n (1)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n \n Steiner tree problems with profits.\n \n \n \n \n\n\n \n Costa, A.; Cordeau, J.; and Laporte, G.\n\n\n \n\n\n\n INFOR, 44: 99–115. 2006.\n ZSCC: 0000042\n\n\n\n
\n\n\n\n \n \n $\"Steiner$ Link\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{costa06steiner,\n\ttitle = {Steiner tree problems with profits},\n\tvolume = {44},\n\tcopyright = {All rights reserved},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2018/06/draft-costa06steiner-1m7qbus.pdf},\n\tjournal = {INFOR},\n\tauthor = {Costa, A.M. and Cordeau, J.-F. and Laporte, G.},\n\tyear = {2006},\n\tnote = {ZSCC: 0000042},\n\tpages = {99--115},\n\tfile = {Costa et al. - 2006 - Steiner tree problems with profits.pdf:/Users/alysson/Zotero/storage/SZT4K84T/Costa et al. - 2006 - Steiner tree problems with profits.pdf:application/pdf},\n}\n\n

\n

\n\n\n\n

\n\n\n\n\n\n

\n

\n \n 2005\n \n \n (1)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n \n A survey on Benders decomposition applied to fixed-charge network design problems.\n \n \n \n \n\n\n \n Costa, A. M.\n\n\n \n\n\n\n Computers & Operations Research, 32: 1429–1450. 2005.\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Link\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@article{costa05survey,\n\ttitle = {A survey on {Benders} decomposition applied to fixed-charge network design problems},\n\tvolume = {32},\n\tcopyright = {All rights reserved},\n\tissn = {0305-0548},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2018/06/draft-costa05survey-2jentcb.pdf},\n\tdoi = {10.1016/j.cor.2003.11.012},\n\tabstract = {Network design problems concern the selection of arcs in a graph in order to satisfy, at minimum cost, some flow requirements, usually expressed in the form of origin–destination pair demands. Benders decomposition methods, based on the idea of partition and delayed constraint generation, have been successfully applied to many of these problems. This article presents a review of these applications.},\n\tlanguage = {en},\n\turldate = {2021-02-01},\n\tjournal = {Computers \\& Operations Research},\n\tauthor = {Costa, A. M.},\n\tyear = {2005},\n\tpages = {1429--1450},\n\tfile = {ScienceDirect Full Text PDF:/Users/alysson/Zotero/storage/9ZSQWT2N/Costa - 2005 - A survey on benders decomposition applied to fixed.pdf:application/pdf;ScienceDirect Snapshot:/Users/alysson/Zotero/storage/9C9E8TKP/S0305054803003435.html:text/html},\n}\n\n

\n

\n\n\n\n\n\n

\n

\n \n 2004\n \n \n (1)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n \n A new method for planning secondary distribution networks.\n \n \n \n \n\n\n \n Costa, A. M.; Garcia, V. J.; Franca, P. M.; and Lyra Filho, C.\n\n\n \n\n\n\n In Fourth IASTED International Conference Power and Energy Systems, pages 437–442, 2004. \n ZSCC: NoCitationData[s0]\n\n\n\n
\n\n\n\n \n \n $\"A$ Link\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@inproceedings{costa04new,\n\ttitle = {A new method for planning secondary distribution networks},\n\tcopyright = {All rights reserved},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2022/02/Costa-et-al.-2004-Series-on-Energy-and-Power-Systems-Proceedings-of-the-4th-IASTED-International-Conference-on-Power-and-Energy-Sy-annotated.pdf},\n\tbooktitle = {Fourth {IASTED} {International} {Conference} {Power} and {Energy} {Systems}},\n\tauthor = {Costa, A. M. and Garcia, V. J. and Franca, P. M. and Lyra Filho, C.},\n\tyear = {2004},\n\tnote = {ZSCC: NoCitationData[s0]},\n\tpages = {437--442},\n}\n\n

\n

\n\n\n\n

\n\n\n\n\n\n

\n

\n \n 2002\n \n \n (1)\n \n \n

\n

\n \n \n

\n \n\n \n \n \n \n \n \n Makespan minimization on parallel processors: An immune-based approach.\n \n \n \n \n\n\n \n Costa, A. M.; Vargas, P.; Von Zuben, F.; and Franca, P.\n\n\n \n\n\n\n In Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002, volume 1, pages 920–925, 2002. \n ZSCC: 0000047\n\n\n\n
\n\n\n\n \n \n $\"Makespan$ Link\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

\n

@inproceedings{costa02makespan,\n\ttitle = {Makespan minimization on parallel processors: {An} immune-based approach},\n\tvolume = {1},\n\tcopyright = {All rights reserved},\n\turl = {Link=https://blogs.unimelb.edu.au/alysson-costa/files/2022/02/Costa-et-al.-2002-IEEE-Proceedings-of-the-2002-Congress-on-Evolutionary-Computation-CEC-2002-annotated.pdf},\n\tdoi = {10.1109/CEC.2002.1007048},\n\tbooktitle = {Proceedings of the 2002 {Congress} on {Evolutionary} {Computation}, {CEC} 2002},\n\tauthor = {Costa, A. M. and Vargas, P.A. and Von Zuben, F.J. and Franca, P.M.},\n\tyear = {2002},\n\tnote = {ZSCC: 0000047},\n\tpages = {920--925},\n\tfile = {Costa et al. - 2002 - Makespan minimization on parallel processors An i.pdf:/Users/alysson/Zotero/storage/UDJ4YEWQ/Costa et al. - 2002 - Makespan minimization on parallel processors An i.pdf:application/pdf},\n}\n\n

\n

\n\n\n\n

\n\n\n\n\n\n

\n