An iterative improvement approach for the nonpreemptive open shop scheduling problem-Reference-Cited by-同舟云学术

An iterative improvement approach for the nonpreemptive open shop scheduling problem

Published:1998-12 Issue:3 Volume:111 Page:509-517
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Liaw Ching-Fang

Publisher

Elsevier BV

Subject

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

Reference15 articles.

1. Open shop scheduling problems with dominated machines;Adiri;Naval Research Logistics Quarterly,1989

2. Ahuja, R.K., Magnanti, T.L., Orlin, J.B., 1993. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ

3. A Polynomial-time algorithm of approximate solution of a scheduling problem;Aksjonov;Upravlyaemye Sistemy,1988

4. Approximation algorithms for three-machine open shop scheduling;Chen;ORSA Journal on Computing,1993

5. An algorithm for the open-shop problem;Fiala;Mathematics of Operations Research,1983

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

1. New efficient heuristics for scheduling open shops with makespan minimization;Computers & Operations Research;2022-06

2. A new efficient biased random key genetic algorithm for open shop scheduling with routing by capacitated single vehicle and makespan minimization;Engineering Applications of Artificial Intelligence;2021-09

3. Four decades of research on the open-shop scheduling problem to minimize the makespan;European Journal of Operational Research;2021-03

4. New controllable processing time scheduling with subcontracting strategy for no-wait job shop problem;International Journal of Production Research;2021-02-20

5. A Generalized Museum Visitor Routing Problem Considering the Preferences and Congestion for Multiple Groups: An Example in Taiwan;Intelligent Automation & Soft Computing;2020