Some no-wait shops scheduling problems: Complexity aspect-Reference-Cited by-同舟云学术

Some no-wait shops scheduling problems: Complexity aspect

Published:1986-03 Issue:3 Volume:24 Page:424-438
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Sriskandarajah Chelliah,Ladet Pierre

Publisher

Elsevier BV

Subject

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

Reference24 articles.

1. Computers and Intractability: a Guide to the Theory of NP-Completeness;Gary,1979

2. The Complexity of flowshop and jobshop scheduling;Gary;Mathematics of Operations Research,1976

3. Sequencing a one-state variable machine: A solvable case of the travelling salesman problem;Gilmore;Operations Research,1964

4. Unit execution time shop problems;Gonzalez;Mathematics of Operations Research,1982

5. A note on the paper: On the flowshop sequencing problem with no-wait in process;Goyal;Operational Research Quarterly,1973

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

1. The non-stop disjoint trajectories problem;Discrete Optimization;2024-05

2. Adaptive Capacity Planning for Ambulatory Surgery Centers;Manufacturing & Service Operations Management;2022-11

3. Hybrid metaheuristics for the integrated and detailed scheduling of production and delivery operations in no-wait flow shop systems;Computers & Industrial Engineering;2022-08

4. Two-stage no-wait hybrid flow shop with inter-stage flexibility for operating room scheduling;Computers & Industrial Engineering;2022-06

5. A survey of job shop scheduling problem: The types and models;Computers & Operations Research;2022-06