99 research outputs found
Recommended from our members
Bicriteria scheduling of a two-machine flowshop with sequence-dependent setup times
The official published version of the article can be found at the link below.A two-machine flowshop scheduling problem is addressed to minimize setups and makespan where each job is characterized by a pair of attributes that entail setups on each machine. The setup times are sequence-dependent on both machines. It is shown that these objectives conflict, so the Pareto optimization approach is considered. The scheduling problems considering either of these objectives are NP-hard , so exact optimization techniques are impractical for large-sized problems. We propose two multi-objective metaheurisctics based on genetic algorithms (MOGA) and simulated annealing (MOSA) to find approximations of Pareto-optimal sets. The performances of these approaches are compared with lower bounds for small problems. In larger problems, performance of the proposed algorithms are compared with each other. Experimentations revealed that both algorithms perform very similar on small problems. Moreover, it was observed that MOGA outperforms MOSA in terms of the quality of solutions on larger problems.Partial Funding from EPSRC under grant EP/D050863/1
04461 Abstracts Collection -- Practical Approaches to Multi-Objective Optimization
From 07.11.04 to 12.11.04, the Dagstuhl Seminar 04461
``Practical Approaches to Multi-Objective Optimization\u27\u27 was held
in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
Recommended from our members
Multiobjective optimization as a decision aid for managing build-to-order supply chains
This paper provides an overview of multiobjective optimization (MOO) as a decision aid in
build-to-order supply chains (BTO-SC). The main features of BTO-SCs are discussed along
with capabilities of MOO to enhance decision making at different points along the chain.
Key decision points across a typical BTO-SC are identified and potential applications of
MOO are discussed. A sample application is presented and future avenues for further research
highlighted
Guest editorsâ preface to the special issue devoted to the 2nd International Conference âNumerical Computations: Theory and Algorithmsâ, June 19â25, 2016, Pizzo Calabro, Italy
This special issue of the Journal of Global Optimization contains twelve high-quality research papers devoted to different aspects of global optimization such as theory, numerical methods and real-life applications. The papers included in this special issue are based on the presentations carefully selected by the guest editors among the talks delivered at the 2nd International Conference âNumerical Computations: Theory and Algorithms (NUMTA)â held in June 19â25, 2016 in Pizzo Calabro, Italy (the first NUMTA conference took place in Falerna, Italy in 2013). The NUMTA 2016 has been organized by the University of Calabria, Rende (CS), Italy, in cooperation with the Society for Industrial and Applied Mathematics, USA. The guest editors actively participated in the organization of the conference: the Program Committee of the NUMTA 2016 was chaired by Yaroslav D. Sergeyev, in their turn, Renato De Leone and Anatoly Zhigljavsky took part in the Program Committee.
The goal of the NUMTA 2016 was creation of a multidisciplinary round table for an open discussion on numerical modeling nature by using traditional and emerging computational paradigms. Participants of this conference discussed several aspects of numerical computations and modeling from foundations of mathematics and computer science to advanced numerical techniques. A large part of presentations has been dedicated to optimization. Selected papers presented at the conference in the field of numerical analysis and respective applications have been published in the special issue of the international journal Applied Mathematics and Computation, Volume 318 (2018). In its turn, the present special issue contains articles dealing with global optimization. Let us give a brief description of the papers included in this special issue
Partitioned real-time scheduling on heterogeneous shared-memory multiprocessors
We consider several real-time scheduling problems on heterogeneous multiprocessor platforms, in which the different processors share a common memory pool. These include (i)~scheduling a collection of implicit-deadline sporadic tasks with the objective of meeting all deadlines; and (ii)~scheduling a collection of independent jobs with the objective of minimizing the makespan of the schedule. Both these problems are intractable (NP-hard). For each, we derive polynomial-time algorithms for solving them approximately, and show that these algorithms have bounded deviation from optimal behavior. We also consider the problem of determining how much common memory a platform needs in order to be able to accommodate a specified real-time workload
- âŚ