Abstract State Machines 1988-1998: Commented ASM Bibliography

An annotated bibliography of papers which deal with or use Abstract State Machines (ASMs), as of January 1998.Comment: Also maintained as a BibTeX file at http://www.eecs.umich.edu/gasm

Branching on multi-aggregated variables

open5siopenGamrath, Gerald; Melchiori, Anna; Berthold, Timo; Gleixner, Ambros M.; Salvagnin, DomenicoGamrath, Gerald; Melchiori, Anna; Berthold, Timo; Gleixner, Ambros M.; Salvagnin, Domenic

An Optimization Model for Single-Warehouse Multi-Agents Distribution Network Problems under Varying of Transportation Facilities: A Case Study

The transportation cost of goods is the highest day-to-day operational cost associated with the food industry sector. A company may be able to reduce logistics cost and simultaneously improve service level by optimizing of distribution network. In reality, a company faces problems considering capacitated transportation facilities and time constraint of delivery. In this paper, we develop a new model of order fulfillment physical distribution to minimize transportation cost under limited of transportation facilities. The first step is defined problem description. After that, we formulate a integer linear programming model for the single-warehouse, multiple-agents considering varying of transportation facilities in multi-period shipment planning. We analyze problems faced by company when should decide policy of distribution due to varying of transportation facilities in volume, type of vehicle, delivery cost, lead time and ownership of facilities. We assumed transportation costs are modeled with a linear term in the objective function. Then, we solve the model with Microsoft Excel Solver 8.0 Version. Finally, we analyze the results with considering amount of transportation facilities, volume usage and total transportation cost. Keywords: physical distribution, shipment planning, integer linear programming, transportation cost, transportation facilities

Several types of types in programming languages

Types are an important part of any modern programming language, but we often forget that the concept of type we understand nowadays is not the same it was perceived in the sixties. Moreover, we conflate the concept of "type" in programming languages with the concept of the same name in mathematical logic, an identification that is only the result of the convergence of two different paths, which started apart with different aims. The paper will present several remarks (some historical, some of more conceptual character) on the subject, as a basis for a further investigation. The thesis we will argue is that there are three different characters at play in programming languages, all of them now called types: the technical concept used in language design to guide implementation; the general abstraction mechanism used as a modelling tool; the classifying tool inherited from mathematical logic. We will suggest three possible dates ad quem for their presence in the programming language literature, suggesting that the emergence of the concept of type in computer science is relatively independent from the logical tradition, until the Curry-Howard isomorphism will make an explicit bridge between them.Comment: History and Philosophy of Computing, HAPOC 2015. To appear in LNC

Assessing partnership alternatives in an IT network employing analytical methods

One of the main critical success factors for the companies is their ability to build and maintain an effective collaborative network. This is more critical in the IT industry where the development of sustainable competitive advantage requires an integration of various resources, platforms, and capabilities provided by various actors. Employing such a collaborative network will dramatically change the operations management and promote flexibility and agility. Despite its importance, there is a lack of an analytical tool on collaborative network building process. In this paper, we propose an optimization model employing AHP and multiobjective programming for collaborative network building process based on two interorganizational relationships’ theories, namely, (i) transaction cost theory and (ii) resource-based view, which are representative of short-term and long-term considerations. The five different methods were employed to solve the formulation and their performances were compared. The model is implemented in an IT company who was in process of developing a large-scale enterprise resource planning (ERP) system. The results show that the collaborative network formed through this selection process was more efficient in terms of cost, time, and development speed. The framework offers novel theoretical underpinning and analytical solutions and can be used as an effective tool in selecting network alternatives