Online scheduling on unbounded parallel-batch machines with incompatible job families-Reference-Cited by-同舟云学术

Online scheduling on unbounded parallel-batch machines with incompatible job families

Published:2011-05 Issue:22 Volume:412 Page:2380-2386
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Tian Ji,Cheng T.C.E.,Ng C.T.,Yuan Jinjiang

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference17 articles.

1. Scheduling a batching machine;Brucker;Journal of Scheduling,1998

2. Approximation algorithms in batch processing;Deng;Journal of Combinatorial Optimization,2003

3. The batch loading and scheduling problem;Dobson;Operations Research,2001

4. Online scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs;Fu;Journal of Scheduling,2009

5. R.Y. Fu, T.C.E. Cheng, C.T. Ng, J.J. Yuan, Online scheduling on two unbounded parallel batch machines with two families of jobs (submitted for publication).

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

1. Online Parallel-Batch Scheduling of Learning Effect Jobs with Incompatible Job Families for Prefabricated Components;Parallel Processing Letters;2023-01-13

2. Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval;Asia-Pacific Journal of Operational Research;2022-03-08

3. Online Batch Scheduling of Simple Linear Deteriorating Jobs with Incompatible Families;Mathematics;2020-02-01

4. Online Scheduling on Two Uniform Unbounded Parallel-Batch Machines to Minimize Makespan;Journal of the Operations Research Society of China;2018-01-31

5. Online Over Time Scheduling on Parallel-Batch Machines: A Survey;Journal of the Operations Research Society of China;2014-11-26