An alternative approach for proving the NP-hardness of optimization problems-Reference-Cited by-同舟云学术

An alternative approach for proving the NP-hardness of optimization problems

Published:2016-01 Issue:1 Volume:248 Page:52-58
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Cheng T.C.E.,Shafransky Y.,Ng C.T.

Funder

Hong Kong Polytechnic University

ISTC

Publisher

Elsevier BV

Subject

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

Reference36 articles.

1. Multiagent scheduling: models and algorithms;Agnetis,2014

2. Scheduling with time dependent processing times: review and extensions;Alidaee;European Journal of Operational Research,1999

3. Complexity and approximation: combinatorial optimization problems and their approximability properties;Ausiello,1999

4. Single-machine scheduling with learning considerations;Biskup;European Journal of Operational Research,1999

5. A state-of-the-art review on scheduling with learning effects;Biskup;European Journal of Operational Research,2008

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

1. Scheduling lower bounds via AND subset sum;Journal of Computer and System Sciences;2022-08

2. A layered genetic algorithm with iterative diversification for optimization of flexible job shop scheduling problems;Advances in Production Engineering & Management;2020-12-24

3. On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty;Journal of Scheduling;2020-09-23

4. A review of four decades of time-dependent scheduling: main results, new topics, and open problems;Journal of Scheduling;2020-01-28

5. Research on improved privacy publishing algorithm based on set cover;Computer Science and Information Systems;2019