• Oplossingen bij analytisch boekhouden en kostencalculatie

      Everaert, Patricia; Bruggeman, Werner (1996)
    • Oplossingen bij analytisch boekhouden en kostencalculatie

      Everaert, Patricia; Bruggeman, Werner (1996)
    • Optichannel retail. Beyond the digital hysteria. Develop and implement a winning strategy as a retailer or brand manufacturer

      Van Ossel, Gino (2019)
      The digital revolution has made customers more demanding than ever. Speed, transparency and hyper-personalization are the new norm. More and more brand manufacturers are now selling directly to consumers in their own stores and webshops. In the meantime, new technologies are already heralding in the next phase of seismic change. In this book, Gino Van Ossel introduces the concept of optichannel, which will guide retailers, brand manufacturers and service companies through and beyond the current wave of digital hysteria. Using recognizable examples, he offers us a realistic view of the retail of the future and sets out a practical framework for a successful strategy that strikes the right balance between profit, competitiveness and customer focus.
    • Optimal cognitive distance and absorptive capacity

      Nooteboom, Bart; Vanhaverbeke, Wim; Gilsing, Victor; Duysters, Geert; Van den Oord, Ad (Research Policy, 2007)
    • Optimal due date assignment in project scheduling

      Vanhoucke, Mario (2002)
      In this paper we introduce the concept of due date assignment in the project scheduling literature. Despite the fact that due date assignment problems belongs to the core of the machine scheduling literature, no attempts have been made to tackle this problem in a project scheduling environment. However, of obvious practical importance, an optimal assignment of due dates is of primary interest to the project manager. In a recent research paper on project scheduling with due dates, the problem has been restricted to considering projects with pre-assigned due dates. In reality, due dates are the results of negotiations, rather than simply dictated by the client of the project. In this paper we consider this negotiation process and take a contractor's point of view who faces the problem of assigning due dates to a particular project, based on the negotiation arguments of the client. We show that the problem under study can be solved by means of the combination of different ideas from the operations research community. Keywords: Project Management, Due date assignment, Weighted earliness-tardiness costs, Due dates,
    • Optimal portfolios with end-of-period target

      Shiraishi, Hiroshi; Ogata, Hiroaki; Amano, Tomoyuki; Valentin, Patilea; Veredas, David; Taniguchi, Masanobu (Advances in Decision Sciences, 2012)
    • Optimised scheduling for weather sensitive offshore construction projects

      Kerkhove, Louis-Philippe; Vanhoucke, Mario (Omega - International Journal of Management Science, 2017)
      The significant lead times and costs associated with materials and equipment in combination with intrinsic and weather related variability render the planning of offshore construction projects highly complex. Moreover, the way in which scarce resources are managed has a profound impact on both the cost and the completion date of a project. Hence, schedule quality is of paramount importance to the profitability of the project. A prerequisite to the creation of good schedules is the accuracy of the procedure used to estimate the project outcome when a given schedule is used. Because of the systematic influence of weather conditions, traditional Monte Carlo simulations fail to produce a reliable estimate of the project outcomes. Hence, the first objective of this research is to improve the accuracy of the project simulation by creating a procedure which includes both uncertainty related to the activities and an integrated model of the weather conditions. The weather component has been designed to create realistically correlated wind- and weather conditions for operationally relevant time intervals. The second objective of this research is to optimise the project planning itself by using both general meta-heuristic optimisation approaches and dedicated heuristics which have been specifically designed for the problem at hand. The performance of these heuristics is judged by the expected net present value of the project. The approach presented in this paper is tested on real data from the construction of an offshore wind farm off the Belgian coast and weather data gathered by the Flanders Marine Institute using measuring poles in the North Sea.
    • Optimized Sourcing Strategies Using Total Cost of Ownership

      Roodhooft, Filip; Hiel, G.; Van den Abbeele, Alexandra; van Doveren, B. (Journal of Cost Management, 2003)
    • Optimizing a multiple objective surgical case sequencing problem

      Cardoen, Brecht; Demeulemeester, Erik; Beliën, Jeroen (International Journal of Production Economics, 2009)
    • Optimizing production capacity and safety stocks in general acyclic supply chains

      Ghadimi, Foad; Aouam, Tarik; Vanhoucke, Mario (Computers and Operations Research, 2020)
      This paper addresses the joint optimization of production capacity and safety stocks in supply chains under the guaranteed service approach (GSA). The integrated problem is formulated as a mixed integer nonlinear program (MINLP) and solution procedures are proposed in the cases of general acyclic and spanning tree networks. For general acyclic supply chains, the integrated problem is solved using a Lagrangian decomposition method which iteratively solves capacity planning and safety stock placement subproblems, and adds budget feasibility constraints to strengthen the Lagrangian decomposition lower bound. When the supply chain has a spanning tree structure, an efficient Lagrangian relaxation heuristic dualizes the budget constraint and solves the relaxed problem using a dynamic programming algorithm. Computational experiments on real-world instances show that the Lagrangian decomposition method is able to solve all instances within 0.1% optimality, while a state-of-the-art solver is unable to provide feasible solutions for large instances. In the case of spanning tree networks, the proposed Lagrangian relaxation heuristic finds optimal or near-optimal solutions and greatly improves running time in comparison to the Lagrangian decomposition method. In addition, numerical experiments show that savings can be achieved through joint optimization of capacity and safety stocks.
    • Opvoeden in de klas

      Van den Broeck, Herman (2006)