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

DOI10.1016/0377-2217(93)90239-JzbMath0842.90060MaRDI QIDQ1310010

Chung-Yee Lee, Jeffrey W. Herrmann

Publication date: 6 August 1996

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

common due date; single-machine scheduling problem; batch delivery; pseudo-polynomial dynamic programming; sum of earliness and tardiness penalties

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Machine scheduling with transportation considerations, Parallel machine scheduling with a common due window, An improved approximation algorithm for single machine scheduling with job delivery, The coordination of scheduling and batch deliveries, Unbounded parallel batch scheduling with job delivery to minimize makespan, Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs, A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs, Scheduling with batch setup times and earliness-tardiness penalties, A survey of the state-of-the-art of common due date assignment and scheduling research, Single machine scheduling with assignable due dates, Machine scheduling with job delivery coordination, Simultaneous minimization of total completion time and total deviation of job completion times, Coordinating multi-location production and customer delivery, Single machine scheduling with release dates and job delivery to minimize the makespan, Logistics scheduling with batching and transportation, Integration of finished goods batch delivery into production scheduling via total tardiness minimization, SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN

Cites Work

• Unnamed Item
• Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
• Batching to Minimize Flow Times on One Machine
• Sequencing with Earliness and Tardiness Penalties: A Review
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case