Design and Optimization of Closed-Loop Supply Chain Management
Bibliographic record
Abstract
Because of cost and environmental concerns, reverse supply chain (RSC) has received a lot of attention. RSC is defined as the activities of the collection and recovery of product returns in supply chain management. The integration of forward supply chain (FSC) and RSC results in a closed-loop supply chain (CLSC). In this dissertation, FSC, RSC, and CLSC are introduced. Then, the research objectives are mentioned. The objective of this dissertation is to develop effective approaches to support closed-loop supply chain configurations and analyses, especially develop methodologies to examine impacts of multi-objectives, and uncertainty on CLSC. In Chapter 2, literature of CLSC configuration is reviewed including deterministic and uncertain models. In addition, gaps in the literature are mentioned. In Chapter 3, a facility location model is examined. After problem definition, a mixed-integer linear programming model is proposed. Then, the model is developed to consider multi-objectives under uncertain demand and return. In Chapter 4, a CLSC network is examined. In this chapter, an integrated model for CLSC configuration and supplier selection is proposed and a solution approach is developed for the multi-objective model. A numerical example is used to validate the model. In Chapter 5, a three stage model for closed-loop supply chain configuration is proposed based on a general network. It is supposed that demand is an uncertain parameter. Besides, an illustrative example is applied to show the three-stage model. In addition, managerial insights are discussed in this chapter. In Chapter 6, a mixed-integer linear programming model is proposed to configure a CLSC network. The network has been designed based on product life cycle. The objective is to maximize profit by determining quantity of parts and products in the network. We also extend the model for the condition that the remanufactured products are sent to the secondary market. Finally in Chapter 7, conclusions and future works are provided.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".