Vlerick Repository
The Vlerick Repository is a searchable open-access publication database, containing the complete archive of research output written by Vlerick Business School faculty and researchers.
Featured Items
Recent Submissions
Item What drives patient cost variability in psoriasis care: a single centre study(Springer Nature, 2025-10-09)Psoriasis a chronic inflammatory skin disease, poses a substantial economic burden on healthcare systems globally. This study examines psoriasis consultations from the provider’s perspective within a dermatology department, aiming to generate detailed cost data to support value-based care. Specifically, it investigates the drivers of consultation-level cost variability, explores opportunities for efficiency, and also estimates one-year treatment costs to inform the development of bundled payment models. The goal is to highlight the importance of patient cost transparency and improving cost structures in chronic disease settings.MethodsUsing Time-Driven Activity-Based Costing (TD-ABC), treatment costs associated with nurses, doctors, and total visits for 127 patients with mild and moderate forms of psoriasis were measured. Financial data was collected in collaboration with the hospital’s financial department. During consultations, nurses and physicians recorded time and patient-related information. Additional or missing details were retrieved from patient medical files. Descriptive analyses assessed mean costs and variability by patient and disease characteristics. Independent variables: therapy type, patient status (new vs. returning), comorbidities, and treatment changes, were stratified to compare cost differences across groups.ResultsMean consultation costs were €55, with a minimum and maximum of €25 and €110. New patients incurred 40% higher costs than returning ones, mainly due to longer interactions with nurses and physicians. Key cost drivers for a total consultation included patient status, personality traits, nurse experience, and therapy switches. Physician consultations were particularly impacted by treatment changes and patient engagement levels. Annual treatment costs varied substantially by medication type: topical treatments averaged €325 per year, systemic treatments €1,353, and biological therapies €11,920, highlighting the significant impact of medication choice on overall expenses.Conclusions: This study highlighted substantial variability in consultation and yearly treatment costs for psoriasis patients. These findings emphasized the critical need for detailed cost data to optimise departmental workflows, support efficient resource allocation, and inform the design of equitable bundled payment models. Improving cost transparency was shown to strengthen clinical and financial decision-making. Future research was recommended to explore the cost implications of comorbidities and to extend benchmarking efforts across dermatology settings to guide system-wide improvements in care delivery and sustainability.Publication Publication Mind the ESG valuation gap - A chatGPT routine to assess ESG value integration in annual reports(Vlerick Business School, 2025)This white paper exposes the gap between sustainability talk and true value creation. Discover why most disclosures overwhelm rather than inform, and how to fix it. Prof Verousis introduces a ChatGPT-powered tool that scans annual reports for real ESG integration. It tests claims against six value-linked pillars: strategy, risk, opportunity, valuation, governance, and disclosure. The result? A clear, comparable ESG integration score that cuts through greenwash. Use it to benchmark peers, track progress, and pinpoint where value is at risk. It works for investors, analysts, executives, and even companies checking their own narrative. Case studies show the wide gap between leaders and laggards. The tool links ESG to cash flow, capital costs, and growth potential. It’s free, scalable, and ready to deploy. Transform ESG from a checkbox to a valuation driver.Item New computational results on the discrete time/cost trade-off problem in project networks(Taylor & Francis, 1998-11)We describe a new exact procedure for the discrete time/cost trade-off problem in deterministic activity-on-the-arc networks of the CPM type, where the duration of each activity is a discrete, nonincreasing function of the amount of a single resource (money) committed to it. The objective is to construct the complete and efficient time/cost profile over the set of feasible project durations. The procedure uses a horizon-varying approach based on the iterative optimal solution of the problem of minimising the sum of the resource use over all activities subject to the activity precedence constraints and a project deadline. This optimal solution is derived using a branch-and-bound procedure which computes lower bounds by making convex piecewise linear underestimations of the discrete time/cost trade-off curves of the activities to be used as input for an adapted version of the Fulkerson labelling algorithm for the linear time/cost trade-off problem. Branching involves the selection of an activity in order to partition its set of execution modes into two subsets which are used to derive improved convex piecewise linear underestimations. The procedure has been programmed in Visual C ++ under Windows NT and has been validated using a factorial experiment on a large set of randomly generated problem instances.Item RanGen: A Random Network Generator for Activity-on-the-Node Networks(Springer Nature, 2003-01)In this paper, we describe RanGen, a random network generator for generating activity-on-the-node networks and accompanying data for different classes of project scheduling problems. The objective is to construct random networks which satisfy preset values of the parameters used to control the hardness of a problem instance. Both parameters which are related to the network topology and resource-related parameters are implemented. The network generator meets the shortcomings of former network generators since it employs a wide range of different parameters which have been shown to serve as possible predictors of the hardness of different project scheduling problems. Some of them have been implemented in former network generators while others have not.