A single machine scheduling problem with air transportation decision

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Production scheduling and transportation strategies in manufacturing systems are two important topics in the fields of production or supply chain management. These two decisions are usually separately discussed in previous works. However, since a business may simultaneously face these two problems, 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. A heuristic approach is developed to deal with this problem. Computational results show that the heuristic approach can produce nearly optimal solutions for small-scale problem and can produce feasible solutions that commercial optimization software, Lingo, can not solve within a reasonable amount of time. © 2011 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

You, P. S., Lee, Y. C., Hsieh, Y. C., & Chen, T. C. (2011). A single machine scheduling problem with air transportation decision. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6591 LNAI, pp. 548–556). Springer Verlag. https://doi.org/10.1007/978-3-642-20039-7_55

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free