Two-machine open shop scheduling with an availability constraint-Reference-Cited by-同舟云学术

Two-machine open shop scheduling with an availability constraint

Published:2001-09 Issue:2 Volume:29 Page:65-77
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Breit Joachim,Schmidt Günter,Strusevich Vitaly A.

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference17 articles.

1. J. Breit, Heuristische Ablaufplanungsverfahren für Flowshops und Openshops mit beschränkt verfügbaren Prozessoren, Ph.D. Thesis, University of Saarland, 2000.

2. J. Breit, G. Schmidt, Two-machine openshop scheduling with an availability constraint, University of Saarland, Department of Economics, Discussion Paper B2001, 2000.

3. Two-machine flowshop scheduling with consecutive availability constraints;Cheng;Inform. Process. Lett.,1999

4. Preemptive scheduling of independent jobs with release and due dates times on open, flow and job shop;Cho;Oper. Res.,1981

5. Computers and intractability: a guide to the theory of NP-completeness;Garey,1979

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

1. Exploring the evolution of machine scheduling through a computational approach;Engineering Applications of Artificial Intelligence;2024-07

2. Multiobjective Parallel Algorithms for Solving Biobjective Open Shop Scheduling Problem;Complexity;2022-08-31

3. Complexity and approximation of open shop scheduling to minimize the makespan: A review of models and approaches;Computers & Operations Research;2022-08

4. A PTAS for non-resumable open shop scheduling with an availability constraint;Journal of Combinatorial Optimization;2021-07-02

5. Two- and three-machine open shop scheduling using LAPT-like rules;Computers & Industrial Engineering;2021-07