A single machine scheduling problem with air transportation decision

碩士 === 國立嘉義大學 === 運輸與物流工程研究所 === 97 === Production scheduling and transportation strategies in manufacturing systems are two important topics in the fields of production or supply chain management. Production scheduling is usually used to decide which job to schedule next when a work center becomes...

Full description

Bibliographic Details
Main Authors: Huang, Pei-Fen, 黃佩芬
Other Authors: You, Peng-Sheng
Format: Others
Language:zh-TW
Published: 2009
Online Access:http://ndltd.ncl.edu.tw/handle/99413032812935263014
Description
Summary:碩士 === 國立嘉義大學 === 運輸與物流工程研究所 === 97 === Production scheduling and transportation strategies in manufacturing systems are two important topics in the fields of production or supply chain management. Production scheduling is usually used to decide which job to schedule next when a work center becomes available so as to reduce the total time span, while transportation strategy usually focuses on the amount shipped between distribution channels so as to reduce logistics costs. These two decisions are usually separately discussed in previous works. However, since a business may simultaneously face the problems of how to deliver goods to customers on time in order to reduce the sum of early and delay costs, and how to distribute goods between distribution channels to minimize the shipping costs, it needs to develop a model to simultaneously deal with these two problems so as to minimize the total costs. This paper deals with a production scheduling and air-transportation problem with a single-machine and multi-delivery destinations. The purpose of this paper is to develop the production scheduling and transportation strategies in order to minimize the sum of early cost, delay cost and transportation cost. The mathematic model established in this research is a constrained non-linear integer programming problem. Lingo 10.0 was used to obtain solutions. The illustrations show that Lingo 10.0 can get optimal solutions within a reasonable amount of time under small scales. A hybrid heuristic is developed to find solutions to this problem. Computational experiments show that the proposed approach is superior to the well-known Lingo 10.0 software in terms of both solution quality and computational effectiveness.