Scheduling unit length jobs with parallel nested machine processing set restrictions-Reference-Cited by-同舟云学术

Scheduling unit length jobs with parallel nested machine processing set restrictions

Published:2006-03 Issue:3 Volume:33 Page:620-638
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Glass C.A.,Mills H.R.

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference14 articles.

1. Complexity of scheduling problems with multi-purpose machines;Brucker;Annals of Operations Research,1997

2. Brucker P. Complexity results for scheduling problems. http://www.mathematik.uni-osnabrueck.de/research/OR/class/pdf/pqr_nop.pdf. From http://www.mathematik.uni-osnabrueck.de/research/OR/class/.

3. A class of generalized multiprocessor scheduling problems;Yang;Systems Science and Mathematical Sciences,2000

4. Hybrid flow shop scheduling with specialist machines. PhD thesis, Department of Mathematics;Mills,2002

5. Minimizing average flow time with parallel machines;Horn;Operations Research,1973

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

1. Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times;Asia-Pacific Journal of Operational Research;2022-04-05

2. Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines;Mathematical Biosciences and Engineering;2022

3. Scheduling Jobs with Release and Delivery Times Subject to Nested Eligibility Constraints;Journal of the Operations Research Society of China;2019-10-30

4. Scheduling equal length jobs with eligibility restrictions;Annals of Operations Research;2019-02-21

5. Parallel batch scheduling with nested processing set restrictions;Theoretical Computer Science;2017-08