A GENERAL ALGORITHM FOR THEn × MFLOWSHOP SCHEDULING PROBLEM†-Reference-Cited by-同舟云学术

A GENERAL ALGORITHM FOR THEn × MFLOWSHOP SCHEDULING PROBLEM†

Published:1968-01 Issue:3 Volume:7 Page:241-247
ISSN:0020-7543
Container-title:International Journal of Production Research
language:en
Short-container-title:International Journal of Production Research

Author:

GUPTA JATINDER N. D.

Publisher

Informa UK Limited

Subject

Industrial and Manufacturing Engineering,Management Science and Operations Research,Strategy and Management

Link

http://www.tandfonline.com/doi/pdf/10.1080/00207546808929814

Reference7 articles.

1. Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem

2. Development ofM-Stage Decision Rule for Scheduling N Jobs ThroughMMachines

3. GUPTA , J. N. D. ( 1967 ). Lexicographic search algorithm for scheduling problems. International Seminar in Operations Research , OSRI , New Delhi , August 7 – 10 , 1967 .

4. Optimal two- and three-stage production schedules with setup times included

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

1. Adaptive Simulation-Based Optimization for Production Scheduling: A Comparative Study;IFAC-PapersOnLine;2022

2. An Effective Decomposition-Based Stochastic Algorithm for Solving the Permutation Flow-Shop Scheduling Problem;Algorithms;2021-03-30

3. Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times;Computers & Operations Research;2016-07

4. A Survey on Occurrence of Critical Machines in a Manufacturing Environment;Procedia Engineering;2014

5. A scheduling model for the refurbishing process in recycling management;International Journal of Production Research;2013-10-17