On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date

Aggarwal, 1990 Baker, 1990, Sequencing with earliness and tardiness penalties: A review, Operations Research, 38, 22, 10.1287/opre.38.1.22 Chen, 1991, A simple algorithm for the error bound of the dynamic lot size model allowing speculative motive Cheng, 1991 Dobson, 1987, Batching to minimize flow times on one machine, Management Science, 33, 784, 10.1287/mnsc.33.6.784 Federgruen, 1991 Federgruen, 1991, A simple forward algorithm to solve general dynamic lot sizing models with n period in O(n log n) or O(n) time, Management Science, 37, 909, 10.1287/mnsc.37.8.909 Hall, 1991, Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date, Operations Research, 39, 836, 10.1287/opre.39.5.836 Hall, 1991, Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date, Operations Research, 39, 847, 10.1287/opre.39.5.847 Lee, 1991, Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date, Computers & Operations Research, 18, 379, 10.1016/0305-0548(91)90098-C Liman, 1992, Error bound for a heuristic on the common due-date scheduling problem, ORSA Journal of Computing Wagelmans, 1992, Economic lot-sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case, Operations Research, 40, S145, 10.1287/opre.40.1.S145