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.
|Titolo:||Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto:
|Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence.pdf||PDF editoriale||NON PUBBLICO - Accesso privato/ristretto||Administrator Richiedi una copia|