Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan-Reference-Cited by-同舟云学术

Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan

Published:2017-07 Issue:1 Volume:260 Page:12-20
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Li Shuguang^ORCID

Funder

National Natural Science Foundation of China

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference51 articles.

1. Approximation schemes for minimizing average weighted completion time with release dates;Afrati,1999

2. Batching and scheduling jobs on batch and discrete processors;Ahmadi;Operations research,1992

3. The complexity of one-machine batching problems;Albers;Discrete Applied Mathematics,1993

4. On-line load balancing in a hierarchical server topology;Bar-Noy;SIAM Journal on Computing,2001

5. Scheduling algorithms;Brucker,2007

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mixed-batch scheduling to minimize total tardiness using deep reinforcement learning;Applied Soft Computing;2024-07

2. Fair scheduling on parallel batch machines with non-identical capacities;Engineering Optimization;2024-05-21

3. Combinatorial optimization methods for yarn dyeing planning;Flexible Services and Manufacturing Journal;2024-05-18

4. Fast approximation algorithms for scheduling uniform parallel batch machines with inclusive processing set restriction;2024 7th International Conference on Advanced Algorithms and Control Engineering (ICAACE);2024-03-01

5. Approximation algorithms for mixed batch scheduling on parallel machines;Journal of the Operational Research Society;2024-02-09