Abstract
One important issue in production and logistics management is the coordination of activities between production and delivery. In this paper, we develop a single-machine scheduling model that incorporates routing decisions of a delivery vehicle which serves customers at different locations. The objective is to minimize the sum of job arrival times. The problem is NP-hard in the strong sense in general. We develop a polynomial time algorithm for the case when the number of customers is fixed. More efficient algorithms are developed for several special cases of the problem. In particular, an algorithm is developed for the single-customer case with a complexity lower than the existing ones. © 2004 Elsevier B.V. All rights reserved.
| Original language | English |
|---|---|
| Pages (from-to) | 39-51 |
| Journal | European Journal of Operational Research |
| Volume | 164 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Jul 2005 |
| Externally published | Yes |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Funding
This research was supported in part by the Research Grants Council of Hong Kong under grant no. PolyU6041/01E.
Research Keywords
- Computational complexity
- Dynamic programming
- Scheduling