Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness-Reference-Cited by-同舟云学术

Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness

Published:2018-09-20 Issue:5 Volume:37 Page:6774-6794
ISSN:0101-8205
Container-title:Computational and Applied Mathematics
language:en
Short-container-title:Comp. Appl. Math.

Author:

Allahverdi Ali,Allahverdi Muberra

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics

Link

http://link.springer.com/article/10.1007/s40314-018-0694-3/fulltext.html

Reference47 articles.

1. Aldowaisan T, Allahverdi A (1998) Total flowtime in no-wait flowshops with separated setup times. Comput Oper Res 25:757–765

2. Allahverdi A (2005) Two-machine flowshop scheduling problem to minimize makespan with bounded setup and processing times. Int J Agile Manuf 8:145–153

3. Allahverdi A (2006a) Two-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times. Int J Prod Econ 103:386–400

4. Allahverdi A (2006b) Two-machine flowshop scheduling problem to minimize maximum lateness with bounded setup and processing times. Kuwait J Sci Eng 33:233–251

5. Allahverdi A (2015) The third comprehensive survey on scheduling problems with setup times/costs. Eur J Oper Res 246:345–378

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

1. A Review of Robust Machine Scheduling;IEEE Transactions on Automation Science and Engineering;2023

2. Setup Time Prediction Using Machine Learning Algorithms: A Real-World Case Study;IFIP Advances in Information and Communication Technology;2023

3. Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times;Hacettepe Journal of Mathematics and Statistics;2022-12-31

4. A survey of scheduling problems with uncertain interval/bounded processing/setup times;Journal of Project Management;2022

5. More effective heuristics for a two-machine no-wait flowshop to minimize maximum lateness;International Journal of Industrial Engineering Computations;2022