Hybrid branch and bound algorithms for the two-stage assembly scheduling problem with separated setup times-Reference-Cited by-同舟云学术

Hybrid branch and bound algorithms for the two-stage assembly scheduling problem with separated setup times

Published:2018-08-21 Issue:5 Volume:57 Page:1398-1412
ISSN:0020-7543
Container-title:International Journal of Production Research
language:en
Short-container-title:International Journal of Production Research

Author:

Luo JianChao¹,Liu ZhiQiang¹,Xing KeYi²

Affiliation:

1. The School of Software and Microelectronics, Northwestern Polytechnical University, Xi’an 710072, People’s Republic of China

2. The State Key Laboratory for Manufacturing Systems Engineering, and Systems Engineering Institute, Xi’an Jiaotong University, Xi’an 710049, People’s Republic of China

Funder

National Natural Science Foundation of China

Aviation Science Foundation of China

National Defense Basic Scientific Research Program

Fundamental Research Funds for the Central Universities

Publisher

Informa UK Limited

Subject

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

Link

https://www.tandfonline.com/doi/pdf/10.1080/00207543.2018.1489156

Reference35 articles.

1. A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times

2. Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times

3. Two-stage assembly scheduling problem for minimizing total tardiness with setup times

4. Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times

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

1. Minimising makespan in distributed assembly hybrid flowshop scheduling problems;International Journal of Production Research;2024-08-02

2. Deadlock control and hybrid social spider scheduling algorithm for two-stage assembly permutation flowshop with limited buffers;Expert Systems with Applications;2024-07

3. A Branch and Bound Algorithm for Minimizing Total Tardiness of a Two-Stage Assembly Problem;2024 39th Youth Academic Annual Conference of Chinese Association of Automation (YAC);2024-06-07

4. A Flexible Job Shop Scheduling Method Based on Multi-Fidelity Optimization;ICAME 2023;2023-09-18

5. One-step production and two-step assembly scheduling in identical factories;Engineering Optimization;2023-08-17