NP-hardness of compact scheduling in simplified open and flow shops-Reference-Cited by-同舟云学术

NP-hardness of compact scheduling in simplified open and flow shops

Published:2001-04 Issue:1 Volume:130 Page:90-98
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Giaro Krzysztof

Publisher

Elsevier BV

Subject

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

Reference12 articles.

1. A.S. Asratian, T.M. Denley, R. Häggkivst, Bipartite Graphs and their Application, Cambridge, 1998

2. The complexity of consecutive Δ-coloring of bipartite graphs: 4 is easy, 5 is hard;Giaro;Ars Combinatoria,1997

3. Compact task scheduling on dedicated processors (in Polish);Giaro;Zeszyty Naukowe Politechniki Ślaskiej Seria Automatyka,1998

4. K. Giaro, Task scheduling without two-sided waiting periods on dedicated processors (in Polish), Ph.D. Thesis, Pol. Gd, W. ETI, Gdańsk, 1999

5. Consecutive edge-colorings of complete and incomplete Cartesian products of graphs;Giaro;Congressus Numerantium,1997

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

1. Reentrant open shop scheduling problem with time lags and no-wait constraints;Computers & Operations Research;2024-06

2. No-Wait Open-Shop Scheduling Problems with Reverse Flows;Journal of Engineering Research;2024-02

3. A Novel Parallel Simulated Annealing Methodology to Solve the No-Wait Flow Shop Scheduling Problem with Earliness and Tardiness Objectives;Processes;2023-02-02

4. Sequencing two classes of jobs on a machine with an external no-idle constraint;International Journal of Production Research;2022-04-25

5. No-Wait Open Shop Scheduling;International Series in Operations Research & Management Science;2021-10-31