Scheduling and Common Due Date Assignment on a Single Parallel-Batching Machine with Batch Delivery

Hua Gong, Biao Zhang and Wuliang Peng

Discrete Dynamics in Nature and Society, 2015, vol. 2015, 1-7

Abstract:

We consider a single parallel-batching machine scheduling problem with delivery involving both batching scheduling and common due date assignment. The orders are first processed on the single parallel-batching machine and then delivered in batches to the customers. The batching machine can process several orders at the same time. The processing time of a production batch on the machine is equal to the longest processing time of the orders assigned into this batch. A common due date for all the orders in the same delivery batch and a delivery date for each order need to be determined in order to minimize total weighted flow time. We first prove that this problem is NP hard in the strong sense. Two optimal algorithms by using dynamic programming are derived for the two special cases with a given sequence of orders on the machine and a given batching in the production part, respectively.

Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/2015/464390.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/2015/464390.xml (text/xml)

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:hin:jnddns:464390

DOI: 10.1155/2015/464390

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().