Two-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times-Reference-Cited by-同舟云学术

Two-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times

Published:2006-09 Issue:1 Volume:103 Page:386-400
ISSN:0925-5273
Container-title:International Journal of Production Economics
language:en
Short-container-title:International Journal of Production Economics

Author:

Allahverdi Ali

Publisher

Elsevier BV

Subject

Industrial and Manufacturing Engineering,Management Science and Operations Research,Economics and Econometrics,General Business, Management and Accounting

Reference15 articles.

1. Minimizing mean flowtime in a two-machine flowshop with sequence independent setup times;Allahverdi;Computers and Operations Research,2000

2. Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times;Allahverdi;International Journal of Mathematics and Mathematical Sciences,2003

3. A review of scheduling research involving setup considerations;Allahverdi;OMEGA The International Journal of Management Sciences,1999

4. Two-machine flowshop minimum length scheduling problem with random and bounded processing times;Allahverdi;International Transactions in Operational Research,2003

5. Semi-on-line scheduling on two parallel processors with an upper bound on the items;Angelelli;Algorithmica,2003

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

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

2. Optimizing the completion time for flow shop scheduling model for multi machine and multi job without job block criteria;SUSTAINABLE DEVELOPMENTS IN MATERIALS SCIENCE, TECHNOLOGY AND ENGINEERING: Sustainable Development in Material Science of Today Is the Innovation of Tomorrow;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. An improved algorithm to minimize the total completion time in a two-machine no-wait flow-shop with uncertain setup times;Journal of Project Management;2022

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