Two-agent single-machine scheduling to minimize the batch delivery cost - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Yunqiang Yin, Yan Wang, T. C. E. Cheng, Dujuan Wang, Chin-Chia Wu. Two-agent single-machine scheduling to minimize the batch delivery cost. Computers & Industrial Engineering, 92:16-30, 2016. [doi]

The following publications are possibly variants of this publication:

Single machine batch scheduling problem with family setup times and release dates to minimize makespanJ. J. Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng. scheduling, 9(6):499-513, 2006. [doi]

Two-agent single-machine scheduling with release dates and preemption to minimize the maximum latenessJ. J. Yuan, C. T. Ng, T. C. Edwin Cheng. scheduling, 18(2):147-153, 2015. [doi]

The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-HardT. C. Edwin Cheng, C. T. Ng, J. J. Yuan. scheduling, 6(5):483-490, 2003.

runs on WebDSL