Similar Search Results

Unary NP-hardness of minimizing the number of tardy jobs with deadlines

Yuan, Jinjiang - In: Journal of scheduling 20 (2017) 2, pp. 211-218

Persistent link: https://www.econbiz.de/10011691589

SINGLE MACHINE SCHEDULING WITH BATCH DELIVERY TO MULTIPLE CUSTOMERS IN A STAR-SHAPED NETWORK

WANG, LEIYANG; LIU, ZHAOHUI - In: Asia-Pacific Journal of Operational Research (APJOR) 30 (2013) 01, pp. 1250048-1

In this paper, we consider the scheduling problem in which the jobs are first processed on a single machine and then delivered in batches by a single vehicle with limited capacity to the respective customers located at the vertices of a star-shaped network. The goal is to minimize the makespan....

Persistent link: https://www.econbiz.de/10010882947

Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work

Chen, Rubing; Gao, Yuan; Geng, Zhichao; Yuan, Jinjiang - In: International journal of production research 61 (2023) 22, pp. 7630-7648

Persistent link: https://www.econbiz.de/10014383411

Online bounded-batch scheduling to minimize total weighted completion time on parallel machines

Ma, Ran; Wan, Long; Wei, Lijun; Yuan, Jinjiang - In: International journal of production economics 156 (2014), pp. 31-38

Persistent link: https://www.econbiz.de/10010410319

A note on Pareto minimizing total completion time and maximum cost

Gao, Yuan; Yuan, Jinjiang - In: Operations research letters 43 (2015) 1, pp. 80-82

Persistent link: https://www.econbiz.de/10010486293

Online tradeoff scheduling on a single machine to minimize makespan and total weighted completion time

Ma, Ran; Yuan, Jinjiang - In: International journal of production economics 158 (2014), pp. 114-119

Persistent link: https://www.econbiz.de/10010438008

Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time

Wei, Hongjun; Yuan, Jinjiang - In: Operations research letters 47 (2019) 1, pp. 41-46

Persistent link: https://www.econbiz.de/10011991332

Semi-online hierarchical scheduling for l p-norm load balancing with buffer or rearrangements

Qi, Xianglai; Yuan, Jinjiang - In: 4OR : a quarterly journal of operations research 15 (2017) 3, pp. 265-276

Persistent link: https://www.econbiz.de/10011742815

Two-machine open-shop scheduling with rejection to minimize the makespan

Zhang, Liqi; Lu, Lingfa; Yuan, Jinjiang - In: OR spectrum : quantitative approaches in management 38 (2016) 2, pp. 519-529

Persistent link: https://www.econbiz.de/10011702079

A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine

Zhao, Qiulan; Yuan, Jinjiang - In: Operations research letters 47 (2019) 6, pp. 607-610

Persistent link: https://www.econbiz.de/10012131895