Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence

Azeddine Cheref (), Alessandro Agnetis (), Christian Artigues () and Jean-Charles Billaut ()
Additional contact information
Azeddine Cheref: Université de Tours, CNRS, LI EA 6300, ERL CNRS 6305
Alessandro Agnetis: Universitá degli Studi di Siena
Christian Artigues: CNRS, LAAS-CNRS, Université de Toulouse
Jean-Charles Billaut: Université de Tours, CNRS, LI EA 6300, ERL CNRS 6305

Journal of Scheduling, 2017, vol. 20, issue 6, No 10, 693 pages

Abstract: Abstract In this paper, we consider an integrated production and outbound delivery scheduling problem. In particular, we address the situation in which the scheduling sequence and the delivery sequence are the same and predefined. A set of jobs are processed on a single machine, and finished jobs are delivered to the customers by a single capacitated vehicle. Each job has a processing time, and transportation times between customers are taken into account. Because the sequence is given, the problem consists in forming batches of jobs and our objective is to minimize the sum of the delivery times or general functions of the delivery times. The NP-hardness of the general problem is established, and a pseudopolynomial time dynamic programming algorithm is given. Some particular cases are treated, for which NP-hardness proofs and polynomial time algorithms are given. Finally, a fixed-parameter tractability result is given.

Keywords: Scheduling; Delivery; Batching; Complexity; Dynamic programming (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-017-0540-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:20:y:2017:i:6:d:10.1007_s10951-017-0540-2

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-017-0540-2

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().