A Modified Disjunctive Graph for Job-Shop Scheduling Problems with Bounded Processing Times and Transportation Constraints-Reference-Cited by-同舟云学术

A Modified Disjunctive Graph for Job-Shop Scheduling Problems with Bounded Processing Times and Transportation Constraints

Published:2012-05 Issue:6 Volume:45 Page:1377-1382
ISSN:1474-6670
Container-title:IFAC Proceedings Volumes
language:en
Short-container-title:IFAC Proceedings Volumes

Author:

Zhang Q.,Manier H.,Manier M.-A

Publisher

Elsevier BV

Subject

General Medicine

Reference12 articles.

1. Adams, J., Balas, E., and Zawack, D. (1988). The shifting bottleneck procedure for job shop scheduling. Management science, 391–401.

2. A time window approach to simultaneous scheduling of machines and material handling system in an FMS;Bilge;Operations Research,1995

3. The disjunctive graph machine representation of the job shop scheduling problem;Blazewicz;European Journal of Operational Research,2000

4. A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles;Deroussi;International journal of production research,2008

5. Deroussi, L. and Norre, S. (2010). Simultaneous scheduling of machines and vehicles for the flexible job shop problem. In International Conference on Metaheuristics and Nature Inspired Computing.

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

1. Integration of routing into a resource-constrained project scheduling problem;EURO Journal on Computational Optimization;2019-12

2. A novel approach based on Neo4j for multi-constrained flexible job shop scheduling problem;Computers & Industrial Engineering;2019-04

3. A new shortest path algorithm to solve the resource-constrained project scheduling problem with routing from a flow solution;Engineering Applications of Artificial Intelligence;2017-11