检索结果-内蒙古大学图书馆

An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times

引用

COMPUTERS & OPERATIONS RESEARCH 2022年 142卷 105733-105733页

作者： Karabulut, Korhan Oztop, Hande Kizilay, Damla Tasgetiren, M. Fatih Kandiller, Levent Yasar Univ Dept Software Engn Izmir Turkey Izmir Democracy Univ Dept Ind Engn Izmir Turkey Auburn Univ Dept Ind & Syst Engn Auburn AL USA Yasar Univ Dept Ind Engn Izmir Turkey

This paper considers a distributed permutation flowshop scheduling problem with sequence-dependent setup times (DPFSP-SDST) to minimize the maximum completion time among the factories. The global economy has enabled large companies to have distributed production centers to become widespread, and effective production scheduling between these centers plays a vital role in the competitiveness of companies. To provide effective scheduling for the DPFSP-SDST, we propose a new mixed-integer linear programming (MILP) model and a new constraint programming (CP) model, which is presented for the first time in literature to the best of our knowledge. As the CP has become a solid competitor to the MILP in the literature, this study aims to exploit the effectiveness of CP to solve such a complex DPFSP-SDST. Since the problem is NP-hard, we also offer an evolution strategy (ES_en) algorithm that employs a self-adaptive scheme to obtain high-quality solutions in a short time. A ruin-and-recreate procedure is also embedded into the developed ES_en. We calibrate the parameters of the proposed ES_en using a design of experiment approach. We also compare the proposed ES_en algorithm's performance with three state-of-the-art metaheuristic algorithms from the literature, i.e., the IG2S (a variant of an iterated greedy algorithm with NEH2_en initialization), IGR (another variant of an iterated greedy algorithm with a restart scheme), and discrete artificial bee colony (DABC) algorithm. A detailed computational experiment is carried out to evaluate the performance of the mathematical models (MILP and CP) and the heuristic algorithms (ES_en, IG2S, IGR, and DABC). A comprehensive benchmark set is generated for the DPFSP-SDST from the well-known PFSP instances from the literature, considering various combinations of jobs, machines, factories, and SDST settings, resulting in 2880 benchmark instances. For 216 out of 240 small-size instances, optimal results are reported by solving the propose

关键词： Distributed flowshop scheduling Sequence-dependent setup times Evolution strategy Mixed-integer programming constraint programming

来源：评论

学校读者我要写书评

暂无评论

Scheduling a cellular manufacturing system based on price elasticity of demand and time-dependent energy prices

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2021年 159卷 107460-107460页

作者： Ebrahimi, Hamidreza Kianfar, Kamran Bijari, Mehdi Univ Isfahan Fac Engn Esfahan *** Iran Isfahan Univ Technol Dept Ind & Syst Engn Esfahan *** Iran

Cellular manufacturing system (CMS) is a novel production system adaptable to the make-to-order production. The present study focuses on scheduling CMS aimed at maximizing total profits as a function of the revenues earned from sales as well as energy consumption cost and order tardiness penalties. The components to be considered in the problem in hand include the time-dependency of energy price, price elasticity of demand, and speed-based power consumption of machines. Two linearization approaches are used to determine order quantities. The first chooses lot sizes from a continuous range while the second chooses them among prespecified discrete levels. Especially developed mathematical models are used to solve the problem in either approach. For the second linearization approach, a constraint programming model, and a hybrid algorithm based on the fixand-optimize and variable neighborhood search metaheuristic (FOVNS, for short) are additionally developed. Changing the branching procedure as a technique and three dominance rules are also proposed to improve the performance of the CP and FOVNS models while their effectiveness is examined using the full factorial design of experiments. Also, the parameters of the FOVNS are tuned using the Taguchi method. Exact methods are found capable of optimizing medium-size problems in less than an hour while FOVNS is able to optimize large-size ones in 822 seconds on average with a deviation of 1.8% from the optimal solution. Statistical analysis show that considering a time-dependent energy price in the scheduling decreases the energy cost by about 40%.

关键词： Cellular manufacturing system Energy-efficient scheduling Price elasticity of demand Mathematical modeling constraint programming Variable neighborhood search

来源：评论

学校读者我要写书评

暂无评论

USDL: A Service-Semantics Description Language for Automatic Service Discovery and Composition

引用

INTERNATIONAL JOURNAL OF WEB SERVICES RESEARCH 2009年第1期6卷 20-48页

作者： Kona, Srividya Bansal, Ajay Simon, Luke Mallya, Ajay Gupta, Gopal Hite, Thomas D. Univ Texas Dallas Dept Comp Sci Dallas TX 75230 USA

Web services and Service-Oriented Computing is being widely adopted. In order to effectively reuse existing services, we need an infrastructure that allows users and applications to discover, deploy, compose, and synthesize services automatically. This automation can take place only if a formal description of the Web services is available. In this article we present an infrastructure using USDL (Universal Service-Semantics Description Language), a language for formally describing the semantics of Web services. USDL is based on the Web Ontology Language (OWL) and employs WordNet as a common basis for understanding the meaning of services. USDL can be regarded as formal service documentation that will allow sophisticated conceptual modeling and searching of available Web services, automated service composition, and other forms of automated service integration. A theory of service substitution using USDL is presented. The rationale behind the design of USDL along with its formal specification in OWL is presented with examples. We also compare USDL with other approaches like OWL-S, WSDL-S, and WSML and show that USDL is complementary to these approaches.

关键词： constraint programming Logic programming Semantic Web Services Web Service Composition Web Service Discovery

来源：评论

学校读者我要写书评

暂无评论

Globalizing constraint models

引用

ARTIFICIAL INTELLIGENCE 2022年 302卷 103599-103599页

作者： Leo, Kevin Mears, Christopher Tack, Guido de la Banda, Maria Garcia Monash Univ Fac IT Melbourne Vic Australia Redbubble Melbourne Vic Australia

We present a method to detect implicit model patterns (such as global constraints) that might be able to replace parts of a combinatorial problem model that are expressed at a low-level. This can help non-expert users write higher-level models that are easier to reason about and often yield better performance. Our method generates candidate model patterns by analyzing both the structure of the model - its constraints, variables, parameters and loops - and the input data from one or more data files. Each candidate is scored by comparing a sample of its solution space with that of the part of the model it is intended to replace. The top-scoring candidates are presented to the user through an interactive display, which shows how they could be incorporated into the model. The method is implemented for the MiniZinc modeling language and available as part of the MiniZinc distribution. (C) 2021 Elsevier B.V. All rights reserved.

关键词： constraint programming constraint acquisition Automated modeling constraint modeling Global constraints

来源：评论

学校读者我要写书评

暂无评论

Optimization of Timed Petri Nets using CP-SAT

引用

IFAC-PapersOnLine 2024年第1期58卷 90-95页

作者： Bengt Lennartson Division of Systems and Control Chalmers University of Technology SE-412 96 Göteborg Sweden

An optimization formulation is presented for timed Petri nets, based on a recently developed optimization solver where a satisfiability solver is integrated with constraint programming. The solver, called CP-SAT, is a part of Google's OR-Tools. The first optimization formulation includes an arbitrary number of concurrent sequences of operations, with shared, alternative, and local resources. A benchmark shows how much faster CP-SAT is compared to both an alternative SAT optimization solver and an A* implementation. The optimization formulation is then generalized to mixed alternative and concurrent sequences. A comparison with a recent MILP formulation for timed Petri nets is presented, showing the strength of the proposed optimization formulation. Finally, an evaluation of an industrial-sized flexible manufacturing system, including uncontrollable events, demonstrates how efficient and easy to implement the proposed strategy is compared to existing results.

关键词： Time-optimal control timed Petri net satisfiability solver constraint programming

来源：评论

学校读者我要写书评

暂无评论

Technicians and Interventions Scheduling for the Maintenance Service of Container Ships

引用

Procedia CIRP 2016年 47卷 216-221页

作者： Antonella Meneghetti Elisa De Zan DPIA - Polytechnic Department of Engineering and Architecture University of Udine Via delle Scienze 206 Udine 33100 Italy

The problem of personnel and interventions scheduling faced by a container ship maintenance service provider (MSPC), commonly the manufacturer of a main ship subsystem such as engines, is analysed. Clients can make a request for a maintenance service of a containership at a given harbour with a given number of days in advance to the desired date, as established in the service contract. The MSPC is allowed to delay the intervention to any future stop of the route within a specified time window depending on its urgency, as set in the contract. The MSPC technicians can be divided into different categories of skills and further distinguished as belonging to the MSPC main company, to the MSP network of subsidiaries, or hired on demand, with different availability constraints, personnel costs, and transport costs in relation to harbour proximity. Delays on planned arrival dates to harbours as well as changes in the duration of stay are common due to bad meteorological conditions, congestions at harbours, or other issues arisen during sailing or previous stops, so a rolling planning horizon should be adopted to face such a dynamic environment. A constraint programming optimisation model hybridized with Large Neighborhood Search is proposed in order to address the problem and its performance compared to actual plans from a world-wide known MSPC. The model has been developed to perform also as a decision making tool; a factorial design of experiment is adopted in order to analyse the impact of a change in some contractual features, such as the minimum time allowed to clients for requiring a service, or the maximum delay allowed to the MSPC to satisfy a service request. How granting clients more flexibility while preserving efficacy and efficiency of the service can so be investigated.

关键词： maintenance service container ships technicians scheduling service contracts constraint programming Large Neighborhood Search

来源：评论

学校读者我要写书评

暂无评论

Définition et résolution d'un modèle complexe de gestion de flotte

引用

Recherche - Transports - Sécurité 1998年 61卷 73-87页

作者： Étienne Gaudin ALCATAL Unite informations et réseaux Route de Nozay 91461 Marcoussis cedex France

This papers concerned with the computerization of freight vehicle fleet management. Contrary to what is widely believed, this problem does not simply involve routing vehicles. The author has used as example to demonstrate that systems which are based on a routing approach are limited because they are based on an oversimplified description of the practices of carriers and because the actions to be performed must be known in order for the model to be applied. The routing is more an algorithmic model for automatically routing vehicles than a management model. The authors approach which is based on deriving several functions from a single model of the actual problem is able use a variety of function adapted computing tools. If makes it possible to deal with models of a different order of complexity.

关键词： Transportation Fleet Management Routing constraint programming

来源：评论

学校读者我要写书评

暂无评论

Developing Approaches for Solving a Telecommunications Feature Subscription Problem

引用

JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH 2010年第1期38卷 271-305页

作者： Lesaint, David Mehta, Deepak O'Sullivan, Barry Quesada, Luis Wilson, Nic Univ Coll Cork Cork Constraint Computat Ctr Cork Ireland

Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature subscription involves choosing and sequencing features from a catalogue and is subject to constraints that prevent undesirable feature interactions at run-time. When the subscription requested by a user is inconsistent, one problem is to find an optimal relaxation, which is a generalisation of the feedback vertex set problem on directed graphs, and thus it is an NP-hard task. We present several constraint programming formulations of the problem. We also present formulations using partial weighted maximum Boolean satisfiability and mixed integer linear programming. We study all these formulations by experimentally comparing them on a variety of randomly generated instances of the feature subscription problem.

关键词： constraint programming

来源：评论

学校读者我要写书评

暂无评论

Just-in-time two-dimensional bin packing *

引用

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE 2021年 102卷 102311-102311页

作者： Polyakovskiy, Sergey M'Hallah, Rym Deakin Univ Sch Informat Technol Geelong Vic 3216 Australia Kuwait Univ Coll Sci Dept Stat & Operat Res POB 5969 Safat 13060 Kuwait

This paper considers the on-time guillotine cutting of small rectangular items from large rectangular bins. Items assigned to a bin define the bins' processing time. Consequently, an item inherits the completion time of its assigned bin. Any deviation of an item's completion time from its due date causes either earliness or tardiness penalties. This just-in-time two-dimensional bin packing problem (JITBP) combines two difficult discrete optimization problems: Bin packing and total weighted earliness tardiness single machine scheduling. It is herein modeled as an integrated constraint program, augmented with two sets of logically redundant constraints that speed the search. The first set uses the concept of dual feasible functions. It focuses on bin packing feasibility. The second is the result of a linear program that schedules filled bins on a single machine. As an alternative to this integrated model, this paper proposes two decomposition cut-and-check approaches that define the master problem (MP) as a relaxation of JITBP where the items are reduced to dimensionless entities. They then reestablish the geometric feasibility of the MPs' solutions by iteratively augmenting MP with Benders cuts generated from the subproblems. The two approaches are similar in concept except that one implements MP as a constraint program (CP) while the second implements it as a mixed-integer program (MIP). Because JITBP is computationally challenging, we test all approaches under a number of heuristic assumptions, which include a maximum runtime for the MIP and CP solvers. The results provide computational evidence that the integrated constraint programming approach performs relatively well, and outperforms the decomposition approach whose MP is a CP. However, both approaches are outperformed by the decomposition approach whose MP is a warm-started MIP. (c) 2020 Elsevier Ltd. All rights reserved.

关键词： Weighted earliness tardiness Bin packing Scheduling constraint programming Hybrid approach Branch-and-check Approximate algorithm

来源：评论

学校读者我要写书评

暂无评论

On Lattice Protein Structure Prediction Revisited

引用

IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2011年第6期8卷 1620-1632页

作者： Dotu, Ivan Cebrian, Manuel Van Hentenryck, Pascal Clote, Peter Boston Coll Dept Biol Chestnut Hill MA 02467 USA Univ Calif San Diego Dept Comp Sci & Engn La Jolla CA 92093 USA Brown Univ Dept Comp Sci Providence RI 02912 USA

Protein structure prediction is regarded as a highly challenging problem both for the biology and for the computational communities. In recent years, many approaches have been developed, moving to increasingly complex lattice models and off-lattice models. This paper presents a Large Neighborhood Search (LNS) to find the native state for the Hydrophobic-Polar (HP) model on the Face-Centered Cubic (FCC) lattice or, in other words, a self-avoiding walk on the FCC lattice having a maximum number of H-H contacts. The algorithm starts with a tabu-search algorithm, whose solution is then improved by a combination of constraint programming and LNS. The flexible framework of this hybrid algorithm allows an adaptation to the Miyazawa-Jernigan contact potential, in place of the HP model, thus suggesting its potential for tertiary structure prediction. Benchmarking statistics are given for our method against the hydrophobic core threading program HPstruct, an exact method which can be viewed as complementary to our method.

关键词： Protein structure constraint programming local search

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：