Selecting green suppliers based on GSCM practices: Using fuzzy TOPSIS applied to a Brazilian electronics company

Due to an increased awareness and significant environmental pressures from various stakeholders, companies have begun to realize the significance of incorporating green practices into their daily activities. This paper proposes a framework using Fuzzy TOPSIS to select green suppliers for a Brazilian electronics company; our framework is built on the criteria of green supply chain management (GSCM) practices. An empirical analysis is made, and the data are collected from a set of 12 available suppliers. We use a fuzzy TOPSIS approach to rank the suppliers, and the results of the proposed framework are compared with the ranks obtained by both the geometric mean and the graded mean methods of fuzzy TOPSIS methodology. Then a Spearman rank correlation coefficient is used to find the statistical difference between the ranks obtained by the three methods. Finally, a sensitivity analysis has been performed to examine the influence of the preferences given by the decision makers for the chosen GSCM practices on the selection of green suppliers. Results indicate that the four dominant criteria are Commitment of senior management to GSCM; Product designs that reduce, reuse, recycle, or reclaim materials, components, or energy; Compliance with legal environmental requirements and auditing programs; and Product designs that avoid or reduce toxic or hazardous material use.     

Scheduling the hospital-wide flow of elective patients

In this paper, we address the problem of planning the patient flow in hospitals subject to scarce medical resources with the objective of maximizing the contribution margin. We assume that we can classify a large enough percentage of elective patients according to their diagnosis-related group (DRG) and clinical pathway. The clinical pathway defines the procedures (such as different types of diagnostic activities and surgery) as well as the sequence in which they have to be applied to the patient. The decision is then on which day each procedure of each patient’s clinical pathway should be done, taking into account the sequence of procedures as well as scarce clinical resources, such that the contribution margin of all patients is maximized. We develop two mixed-integer programs (MIP) for this problem which are embedded in a static and a rolling horizon planning approach. Computational results on real-world data show that employing the MIPs leads to a significant improvement of the contribution margin compared to the contribution margin obtained by employing the planning approach currently practiced. Furthermore, we show that the time between admission and surgery is significantly reduced by applying our models.     

Adjusting a railway timetable in case of partial or complete blockades

Unexpected events, such as accidents or track damages, can have a significant impact on the railway system so that trains need to be canceled and delayed. In case of a disruption it is important that dispatchers quickly present a good solution in order to minimize the nuisance for the passengers. In this paper, we focus on adjusting the timetable of a passenger railway operator in case of major disruptions. Both a partial and a complete blockade of a railway line are considered. Given a disrupted infrastructure situation and a forecast of the characteristics of the disruption, our goal is to determine a disposition timetable, specifying which trains will still be operated during the disruption and determining the timetable of these trains. Without explicitly taking the rolling stock rescheduling problem into account, we develop our models such that the probability that feasible solutions to this problem exist, is high. The main objective is to maximize the service level offered to the passengers. We present integer programming formulations and test our models using instances from Netherlands Railways.     

A 4D-sequencing approach for air traffic management

The current air traffic system is forecasted to face strong challenges due to the continuous increase in air traffic demand. Hence, there is a need for new types of organization permitting a more efficient air traffic management, with both a high capacity and a high level of safety, and possibly with a reduced environmental impact. In this article, we study a holistic approach, consisting in designing across Europe a very organized air traffic system, as opposed to free flight, to reduce costs while maintaining safety.     

Computing approximate Nash equilibria in general network revenue management games

Computing optimal capacity allocations in network revenue management is computationally hard. The problem of computing exact Nash equilibria in non-zero-sum games is computationally hard, too. We present a fast heuristic that, in case it cannot converge to an exact Nash equilibrium, computes an approximation to it in general network revenue management problems under competition. We also investigate the question whether it is worth taking competition into account when making (network) capacity allocation decisions. Computational results show that the payoffs in the approximate equilibria are very close to those in exact ones. Taking competition into account never leads to a lower revenue than ignoring competition, no matter what the competitor does. Since we apply linear continuous models, computation time is very short.     

Strategic and operational decisions in restaurant revenue management

The paper addresses restaurant revenue management from both a strategic and an operational point of view. Strategic decisions in restaurants are mainly related to defining the most profitable combination of tables that will constitute the restaurant. We propose new formulations of the so-called “Tables Mix Problem” by taking into account several features of the real setting. We compare the proposed models in a computational study showing that restaurants, with the capacity of managing tables as renewable resources and of combining different-sized tables, can improve expected revenue performances. Operational decisions are mainly concerned with the more profitable assignment of tables to customers. Indeed, the “Parties Mix Problem” consists of deciding on accepting or denying a booking request from different groups of customers, with the aim of maximizing the total expected revenue. A dynamic formulation of the “Parties Mix Problem” is presented together with a linear programming approximation, whose solutions can be used to define capacity control policies based on booking limits and bid prices. Computational results compare the proposed policies and show that they lead to higher revenues than the traditional strategies used to support decision makers.     

Optimal credit period and lot size for deteriorating items with expiration dates under two-level trade credit financing

In a supplier-retailer-buyer supply chain, the supplier frequently offers the retailer a trade credit of S periods, and the retailer in turn provides a trade credit of R periods to her/his buyer to stimulate sales and reduce inventory. From the seller’s perspective, granting trade credit increases sales and revenue but also increases opportunity cost (i.e., the capital opportunity loss during credit period) and default risk (i.e., the percentage that the buyer will not be able to pay off her/his debt obligations). Hence, how to determine credit period is increasingly recognized as an important strategy to increase seller’s profitability. Also, many products such as fruits, vegetables, high-tech products, pharmaceuticals, and volatile liquids not only deteriorate continuously due to evaporation, obsolescence and spoilage but also have their expiration dates. However, only a few researchers take the expiration date of a deteriorating item into consideration. This paper proposes an economic order quantity model for the retailer where: (a) the supplier provides an up-stream trade credit and the retailer also offers a down-stream trade credit, (b) the retailer’s down-stream trade credit to the buyer not only increases sales and revenue but also opportunity cost and default risk, and (c) deteriorating items not only deteriorate continuously but also have their expiration dates. We then show that the retailer’s optimal credit period and cycle time not only exist but also are unique. Furthermore, we discuss several special cases including for non-deteriorating items. Finally, we run some numerical examples to illustrate the problem and provide managerial insights.     

More than a second channel? Supply chain strategies in B2B spot markets

The emergence of B2B spot markets has greatly facilitated spot trading and impacted supply chain structures as well as the way commercial transactions take place between firms in many industries. While providing new opportunities, the B2B spot market also exposes participants to a price risk. This new business landscape raises some important questions on how the supplier and manufacturer should change their sales channel and procurement strategies and tailor their decisions to this changing environment. In this paper, we study the channel-choice, pricing and ordering/production decisions of the risk-averse supplier and manufacturer in a two-tier supply chain with a B2B spot market. Our analysis shows that, to benefit from the B2B spot market and control the risk exposure, the upstream supplier should develop an integrated channel-choice and pricing strategy. When the supplier adopts a dual-channel strategy, the equilibrium contract price decreases in the supplier’s risk attitude, but increases in the demand uncertainty. However, it first decreases and then increases in the manufacturer’s risk attitude and spot price volatility. We conclude that rather than simply being a second channel, the B2B spot market provides a strategic tool to supply chain members to achieve an advantageous position in their contract trading.     

Make-or-buy service capacity decision in a supply chain providing after-sales service

We consider a supply chain comprising a manufacturer and a retailer. The manufacturer supplies a product to the retailer, while the retailer sells the product bundled with after-sales service to consumers in a fully competitive market. The sales volume is affected by the retailer’s service-level commitment. The retailer can build service capacity in-house at a deterministic price before service demand is realized, or buy the service from an outsourcing market at an uncertain price after service demand realization. We find that the outsourcing market encourages the retailer to make a higher level of service commitment, while prompting the manufacturer to reduce the wholesale price, resulting in more demand realization. We analyze how the expected cost of the service in the outsourcing market and the retailer’s risk attitude affect the decisions of both parties. We derive the conditions under which the retailer is willing to build service capacity in-house and under which it will buy the service from the outsourcing market. Moreover, we find that the manufacturer’s sharing with the retailer the cost to build service capacity improves the profits of both parties.     

A greedy algorithm for the two-level nested logit model

We consider the assortment optimization problem under the classical two-level nested logit model. We establish a necessary and sufficient condition for the optimal assortment and develop a simple and fast greedy algorithm that iteratively removes at most one product from each nest to compute an optimal solution.