On the complexity of coupled-task scheduling-Reference-Cited by-同舟云学术

On the complexity of coupled-task scheduling

Published:1997-01 Issue:1-2 Volume:72 Page:141-154
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Orman A.J.,Potts C.N.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference8 articles.

1. Shop problems with two machines and time lags;Dell'Amico,1993

2. Computers and Intractability, a Guide to the Theory of NP-Completeness;Garey,1979

3. Optimisation and approximation in deterministic sequencing and scheduling: a survey;Graham;Ann. Discrete Math.,1979

4. Optimal two-and three-stage production schedules with setup times included;Johnson;Naval Res. Logist. Quart.,1954

5. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, Centre for Mathematics and Computer Science, Report BS-R8909, The Netherlands.

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

1. Scheduling periodic messages on a shared link without buffering;Journal of Scheduling;2024-07-16

2. New efficient algorithms for the two-machine no-wait chain-reentrant shop problem;Journal of Combinatorial Optimization;2024-06-16

3. Enhancing the effectiveness of joint production and maintenance scheduling based on a multi-agent system and a Pigouvian approach of externalities;Production Engineering;2024-03-23

4. Scheduling coupled tasks on parallel identical machines;Optimization Letters;2023-07-10

5. Approximation algorithms for coupled task scheduling minimizing the sum of completion times;Annals of Operations Research;2023-04-25