Optimal just-in-time schedules for flexible transfer lines-Reference-Cited by-同舟云学术

Optimal just-in-time schedules for flexible transfer lines

Published:1994-04 Issue:2 Volume:6 Page:137-154
ISSN:0920-6299
Container-title:International Journal of Flexible Manufacturing Systems
language:en
Short-container-title:Int J Flex Manuf Syst

Author:

Kubiak Wieslaw,Sethi Suresh P.

Publisher

Springer Science and Business Media LLC

Subject

Industrial and Manufacturing Engineering,Management Science and Operations Research

Link

http://link.springer.com/article/10.1007/BF01328809/fulltext.html

Reference9 articles.

1. Balas, E., Miller, D., Pekny, J. and Toth, P., ?A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem,?Journal of the Association of Computing Machinery, Vol. 38, pp. 985?1004 (1991).

2. Browne, J. Dubois, D., Rathmill, K., Sethi, S. and Stecke, K. ?Classification of Flexible Manufacturing Systems,?The FMS Magazine, pp. 114?117 (April 1984).

3. Dar-el, E.M., ?Mixed-Model Assembly Line Sequencing Problems,?Omega, Vol. 6, No. 4, pp. 313?323 (1978).

4. Kilbridge, M.D. and Wester, L., ?The Line Model-Mix Sequencing Problem,?Proceedings of the Third International Conference on Operations Research, Oslo, English Universities Press (Dunod Editeur), p. 247, Paris (1963).

5. Miltenburg, J., ?Level Schedules for Mixed-Level Assembly Lines In Just-In-Time Production Systems,?Management Science, Vol. 35, No. 2, pp. 192?207 (1989).

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

1. An efficient implementation of a VNS heuristic for the weighted fair sequences problem;International Transactions in Operational Research;2022-08-09

2. Webster sequences, apportionment problems, and just-in-time sequencing;Discrete Applied Mathematics;2022-01

3. Interval Balanced Multiprocessor Scheduling of Modular Jobs;Journal of Communications Technology and Electronics;2021-12

4. Output Rate Variation Problem: Some Heuristic Paradigms and Dynamic Programming;Springer Proceedings in Mathematics & Statistics;2016

5. Job release scheduling problem: Complexity and an approximation algorithm;Discrete Applied Mathematics;2013-04