A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs-Reference-Cited by-同舟云学术

A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs

Published:1994-03 Issue:1 Volume:16 Page:5-7
ISSN:0171-6468
Container-title:Operations-Research-Spektrum
language:en
Short-container-title:OR Spektrum

Author:

Brucker Peter

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,Business, Management and Accounting (miscellaneous)

Link

http://link.springer.com/content/pdf/10.1007/BF01719698.pdf

Reference3 articles.

1. Kravchenko SA, Sotskov YN (1993) Optimal makespan schedule for three jobs on two machines, Working Paper, Institute of Engineering Cybernetics of the Byelorussian Academy of Sciences, Minsk

2. Sotskov YN (1991) The complexity of shop-scheduling problems with two or three jobs. Eur J Oper Res 53:326–336

3. Sotskov YN, Shakhlevich NV (1993) NP-hardness of shopscheduling problems with three jobs. Disc Appl Math (to appear)

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

1. Two-machine job-shop scheduling with one joint job;Discrete Applied Mathematics;2024-03

2. An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents;European Journal of Operational Research;2024-02

3. Exact Algorithms for Two-Machine Job-Shop Scheduling Problem with One Joint Job Considering Machine Repetition and Transportation Times;2022 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM);2022-12-07

4. Predictors of first lifetime episodes of major depression in midlife women;Psychological Medicine;2008-04-01

5. Exact, Heuristic and Meta-heuristic Algorithms for Solving Shop Scheduling Problems;Metaheuristics for Scheduling in Industrial and Manufacturing Applications;2008