Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
From MaRDI portal
Publication:4340803
DOI10.1137/S1052623494269540zbMath0874.68142MaRDI QIDQ4340803
Cheng, T. C. Edwin, Bertrand M. T. Lin, Mikhail Y. Kovalyov
Publication date: 12 June 1997
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
dynamic programming; polynomial algorithms; single machine scheduling; NP-hardness; batch scheduling
Related Items
Unnamed Item, Batch delivery scheduling with batch delivery cost on a single machine, Single processor scheduling with job values depending on their completion times, A zero-inventory production and distribution problem with a fixed customer sequence, Production scheduling with supply and delivery considerations to minimize the makespan, Parallel machine batching and scheduling with deadlines, Two-machine flowshop batching and scheduling, Scheduling with batching: A review, Single machine scheduling to minimize the setup time and the earliness