Single-machine batch delivery scheduling with an assignable common due date and controllable processing times

• Published in: Computers & industrial engineering Vol. 65; no. 4; pp. 652 - 662
• Main Authors: Yin, Yunqiang, Cheng, T.C.E., Cheng, Shuenn-Ren, Wu, Chin-Chia
• Format: Journal Article
• Language: English
• Published: New York Elsevier Ltd 01.08.2013; Pergamon Press Inc
• Subjects: Algorithms; Assignment problem; Batch delivery; Common due date; Deliveries; Dynamic programming; Job shops; Optimization algorithms; Production scheduling; Resource allocation; Scheduling; Studies; Transportation problem (Operations research); Scheduling; Common due date; Batch delivery; Resource allocation

•We consider single-machine batch delivery scheduling with an assignable common due date and controllable processing times.•We first provide an O(n5) dynamic programming algorithm to find the optimal job sequence.•We show that a special case of the problem with a lower-order polynomial time and deve...