A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem-Reference-Cited by-同舟云学术

A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem

Published:1989-12 Issue:3 Volume:43 Page:267-270
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Kubiak Wieslaw

Publisher

Elsevier BV

Subject

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

Reference8 articles.

1. Scheduling unit-time tasks on flow-shops under resource constraints;Blz̊ewicz;Annals of Operations Research,1988

2. Minimizing maximum lateness in a two-machine unit-time job shop;Brucker;Computing,1981

3. A linear time algorithm to minimize maximum lateness for the two-machine, unit-time, job-shop scheduling problem;Brucker,1982

4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

5. An efficient optimal algorithm for the two-machine unit-time jobshop schedule-length problem;Hefetz;Mathematics of Operations Research,1982

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

1. A simple migrating birds optimization algorithm with two search modes to solve the no-wait job shop problem;Expert Systems with Applications;2024-03

2. A Simple Migrating Birds Optimization Algorithm with Two Search Modes to Solve the No-Wait Job Shop Problem;2023

3. Minimizing total completion time in the no-wait jobshop scheduling problem using a backtracking metaheuristic;Computers & Industrial Engineering;2022-07

4. A cooperative coevolutionary algorithm approach to the no-wait job shop scheduling problem;Expert Systems with Applications;2022-05

5. Proportionate and Ordered Open Shops;International Series in Operations Research & Management Science;2021-10-31