Job-shop scheduling with resource-time models of operations-Reference-Cited by-同舟云学术

Job-shop scheduling with resource-time models of operations

Published:1987-01 Issue:1 Volume:28 Page:58-73
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Grabowski Józef,Janiak Adam

Publisher

Elsevier BV

Subject

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

Reference16 articles.

1. Discrete programming by the filter method;Balas;Operations Research,1967

2. Machine sequencing via disjunctive graphs—An implicit enumeration algorithm;Balas;Operations Research,1969

3. Job-shop scheduling: A comparison of three enumeration schemes in a branch-and-bound approach;Bouma,1982

4. Project scheduling under resource constraints-Historical review and categorization of procedures;Davis;AIIE Transactions,1973

5. Algorithm of solving of the maximal network flow problem;Dinic;Doklady A.N. C.C.C.P.,1970

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

1. Efficient scheduling of a stochastic no-wait job shop with controllable processing times;Expert Systems with Applications;2020-12

2. Two decompositions for the bicriteria job-shop scheduling problem with discretely controllable processing times;International Journal of Production Research;2012-12-15

3. Scheduling two agents with controllable processing times;European Journal of Operational Research;2010-09

4. A FRAMEWORK FOR MACHINE SCHEDULING PROBLEMS WITH CONTROLLABLE PROCESSING TIMES;Production and Operations Management;2009-01-05

5. A survey of scheduling with controllable processing times;Discrete Applied Mathematics;2007-08