Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times-Reference-Cited by-同舟云学术

Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times

Published:2009-11-26 Issue:21 Volume:48 Page:6367-6385
ISSN:0020-7543
Container-title:International Journal of Production Research
language:en
Short-container-title:International Journal of Production Research

Author:

Allahverdi Ali¹,Aydilek Harun²

Affiliation:

1. a Department of Industrial and Management Systems Engineering , College of Engineering and Petroleum, Kuwait University , P.O. Box 5969, Safat, Kuwait

2. b Department of Natural Sciences and Mathematics , Gulf University for Science and Technology , P.O. Box 7207, Hawally 32093, Kuwait

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/00207540903321657

Reference41 articles.

1. Two-Stage Production Scheduling with Separated Set-up Times and Stochastic Breakdowns

2. Scheduling in stochastic flowshops with independent setup, processing and removal times

3. A review of scheduling research involving setup considerations

4. A survey of scheduling problems with setup times or costs

5. Two-machine ordered flowshop scheduling under random breakdowns

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

1. Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times;RAIRO - Operations Research;2023-07

2. Robust identical parallel machine scheduling with two-stage time-of-use tariff and not-all-machine option;International Journal of Production Research;2023-06-27

3. A branch-and-bound approach to minimise the value-at-risk of the makespan in a stochastic two-machine flow shop;International Journal of Production Research;2023-05-26

4. A Substantially Improved New Algorithm for Flowshop Scheduling Problem with Uncertain Processing Times;Uluslararası Muhendislik Arastirma ve Gelistirme Dergisi;2022-01-31

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