Bütünleşik tedarik zinciri çizelgeleme modelleri: Bir literatür taraması

Research on integration of supply chain and scheduling is relatively recent, and number of studies on this topic is increasing. This study provides a comprehensive literature survey about Integrated Supply Chain Scheduling (ISCS) models to help identify deficiencies in this area. For this purpose, it is thought that this study will contribute in terms of guiding researchers working in this field. In this study, existing literature on ISCS problems are reviewed and summarized by introducing the new classification scheme. The studies were categorized by considering the features such as the number of customers (single or multiple), product lifespan (limited or unlimited), order sizes (equal or general), vehicle characteristics (limited/sufficient and homogeneous/heterogeneous), machine configurations and number of objective function (single or multi objective). In addition, properties of mathematical models applied for problems and solution approaches are also discussed.Bütünleşik Tedarik Zinciri Çizelgeleme (BTZÇ) üzerine yapılan araştırmalar nispeten yenidir ve bu konu üzerine yapılan çalışma sayısı artmaktadır. Bu çalışma, bu alandaki eksiklikleri tespit etmeye yardımcı olmak için BTZÇ modelleri hakkında kapsamlı bir literatür araştırması sunmaktadır. Bu amaçla, bu çalışmanın bu alanda çalışan araştırmacılara rehberlik etmesi açısından katkı sağlayacağı düşünülmektedir. Bu çalışmada, BTZÇ problemleri üzerine mevcut literatür gözden geçirilmiş ve yeni sınıflandırma şeması tanıtılarak çalışmalar özetlenmiştir. Çalışmalar; tek veya çoklu müşteri sayısı, sipariş büyüklüğü tipi (eşit veya genel), ürün ömrü (sınırlı veya sınırsız), araç karakteristikleri (sınırlı/yeterli ve homojen/heterojen), makine konfigürasyonları ve amaç fonksiyonu sayısı (tek veya çok amaçlı) gibi özellikler dikkate alınarak kategorize edildi. Ayrıca problemler için uygulanan matematiksel modellerin özellikleri ve çözüm yaklaşımları da tartışılmıştır

Coordinating production and distribution of jobs with bundling operations

Department of Logistics2006-2007 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Coordinated scheduling of customer orders with decentralized machine locations

Department of Logistics2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

The relevance of outsourcing and leagile strategies in performance optimization of an integrated process planning and scheduling

Over the past few years growing global competition has forced the manufacturing industries to upgrade their old production strategies with the modern day approaches. As a result, recent interest has been developed towards finding an appropriate policy that could enable them to compete with others, and facilitate them to emerge as a market winner. Keeping in mind the abovementioned facts, in this paper the authors have proposed an integrated process planning and scheduling model inheriting the salient features of outsourcing, and leagile principles to compete in the existing market scenario. The paper also proposes a model based on leagile principles, where the integrated planning management has been practiced. In the present work a scheduling problem has been considered and overall minimization of makespan has been aimed. The paper shows the relevance of both the strategies in performance enhancement of the industries, in terms of their reduced makespan. The authors have also proposed a new hybrid Enhanced Swift Converging Simulated Annealing (ESCSA) algorithm, to solve the complex real-time scheduling problems. The proposed algorithm inherits the prominent features of the Genetic Algorithm (GA), Simulated Annealing (SA), and the Fuzzy Logic Controller (FLC). The ESCSA algorithm reduces the makespan significantly in less computational time and number of iterations. The efficacy of the proposed algorithm has been shown by comparing the results with GA, SA, Tabu, and hybrid Tabu-SA optimization methods

A survey of scheduling problems with setup times or costs

Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Serial-batch scheduling – the special case of laser-cutting machines

The dissertation deals with a problem in the field of short-term production planning, namely the scheduling of laser-cutting machines. The object of decision is the grouping of production orders (batching) and the sequencing of these order groups on one or more machines (scheduling). This problem is also known in the literature as "batch scheduling problem" and belongs to the class of combinatorial optimization problems due to the interdependencies between the batching and the scheduling decisions. The concepts and methods used are mainly from production planning, operations research and machine learning

Planning and Scheduling Optimization

Although planning and scheduling optimization have been explored in the literature for many years now, it still remains a hot topic in the current scientific research. The changing market trends, globalization, technical and technological progress, and sustainability considerations make it necessary to deal with new optimization challenges in modern manufacturing, engineering, and healthcare systems. This book provides an overview of the recent advances in different areas connected with operations research models and other applications of intelligent computing techniques used for planning and scheduling optimization. The wide range of theoretical and practical research findings reported in this book confirms that the planning and scheduling problem is a complex issue that is present in different industrial sectors and organizations and opens promising and dynamic perspectives of research and development

SUPPLY CHAIN SCHEDULING FOR MULTI-MACHINES AND MULTI-CUSTOMERS

Manufacturing today is no longer a single point of production activity but a chain of activities from the acquisition of raw materials to the delivery of products to customers. This chain is called supply chain. In this chain of activities, a generic pattern is: processing of goods (by manufacturers) and delivery of goods (to customers). This thesis concerns the scheduling operation for this generic supply chain. Two performance measures considered for evaluation of a particular schedule are: time and cost. Time refers to a span of the time that the manufacturer receives the request of goods from the customer to the time that the delivery tool (e.g. vehicle) is back to the manufacturer. Cost refers to the delivery cost only (as the production cost is considered as fi xed). A good schedule is thus with short time and low cost; yet the two may be in conflict. This thesis studies the algorithm for the supply chain scheduling problem to achieve a balanced short time and low cost. Three situations of the supply chain scheduling problem are considered in this thesis: (1) a single machine and multiple customers, (2) multiple machines and a single customer and (3) multiple machines and multiple customers. For each situation, di fferent vehicles characteristics and delivery patterns are considered. Properties of each problem are explored and algorithms are developed, analysed and tested (via simulation). Further, the robustness of the scheduling algorithms under uncertainty and the resilience of the scheduling algorithms under disruptions are also studied. At last a case study, about medical resources supply in an emergency situation, is conducted to illustrate how the developed algorithms can be applied to solve the practical problem. There are both technical merits and broader impacts with this thesis study. First, the problems studied are all new problems with the particular new attributes such as on-line, multiple-customers and multiple-machines, individual customer oriented, and limited capacity of delivery tools. Second, the notion of robustness and resilience to evaluate a scheduling algorithm are to the best of the author's knowledge new and may be open to a new avenue for the evaluation of any scheduling algorithm. In the domain of manufacturing and service provision in general, this thesis has provided an e ffective and effi cient tool for managing the operation of production and delivery in a situation where the demand is released without any prior knowledge (i.e., on-line demand). This situation appears in many manufacturing and service applications

Scheduling and Batching in Multi-Site Flexible Flow Shop Environments

Global competition and the customers demand for customized products with shorter due dates, marked the introduction of the Extended Enterprise. In this Extended Manufacturing Environment (EME), lean, virtual, networked and distributed enterprises collaborate to respond to the market demands. In this paper we study the influence of the batch size on Flexible Flow Shop makespan minimization problem FFC vertical bar vertical bar C-max for two multi-sites approaches, the FSBF (Flow Shop Based Factories) and the PMBF (Parallel-Machines Based Factories). The computational study demonstrates how the performance of the PMBF model decreases with the increase of batch size and determines the batch sizes in which the performance is similar.This work is supported by FEDER Funds through the “Programa Operacional Factores de Competitividade - COMPETE” program and by National Funds through FCT “Fundação para a Ciência e a Tecnologia” under the projects: “Projeto Estratégico–UI 252–2011–2012” reference PEstOE/EME/UI0252/2014, FCOMP-01-0124-FEDER-PEstOE/EEI/UI0760/2014.info:eu-repo/semantics/publishedVersio