89
Views
24
CrossRef citations to date
0
Altmetric
Theoretical Paper

A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints

&
Pages 572-582 | Received 01 Apr 2006, Accepted 01 Jan 2008, Published online: 21 Dec 2017

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (4)

Hyeon-Il Kim & Dong-Ho Lee. (2023) Scheduling algorithms for multi-stage flow shops with reworks under overlapped queue time limits. International Journal of Production Research 61:20, pages 6908-6922.
Read now
Jun-Hee Han & Ju-Yong Lee. (2023) Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing. Engineering Optimization 55:10, pages 1742-1759.
Read now
Yonglin Li & Zhenhua Dai. (2020) A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time. Engineering Optimization 52:3, pages 484-506.
Read now
S.F. Attar, M. Mohammadi, R. Tavakkoli-Moghaddam & S. Yaghoubi. (2014) Solving a new multi-objective hybrid flexible flowshop problem with limited waiting times and machine-sequence-dependent set-up time constraints. International Journal of Computer Integrated Manufacturing 27:5, pages 450-469.
Read now

Articles from other publishers (20)

Yooney Cho, Hyeon-Il Kim, Yeo-Reum Kim, Seock-Kyu Yoo, Byoung-Hee Kim & Dong-Ho Lee. (2023) A scheduling mechanism for hybrid flow shops with reworks under general queue time limits. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture.
Crossref
BongJoo Jeong, Jun-Hee Han & Ju-Yong Lee. (2021) Metaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times. Algorithms 14:11, pages 323.
Crossref
Rudi Nurdiansyah, I-Hsuan Hong & Pin-Kuan Lee. (2021) Real-time admission control in a queue-time loop production system. Computers & Industrial Engineering 161, pages 107617.
Crossref
Jun-Ho Lee, Tae-Sun Yu & Kyungsu Park. (2021) Scheduling of Flow Shop with Overlapping Waiting Time Constraints Using Genetic Algorithm. Journal of the Korean Institute of Industrial Engineers 47:1, pages 34-44.
Crossref
Ju-Yong Lee. (2020) A Genetic Algorithm for a Two-Machine Flowshop with a Limited Waiting Time Constraint and Sequence-Dependent Setup Times. Mathematical Problems in Engineering 2020, pages 1-13.
Crossref
Caio Paziani Tomazella & Marcelo Seido Nagano. (2020) A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem. Expert Systems with Applications 158, pages 113556.
Crossref
Kejia Chen, Debiao Li & Xiao Wang. (2020) Makespan Minimization in Two-Machine Flow-Shop Scheduling under No-wait and Deterministic Unavailable Interval Constraints. Journal of Systems Science and Systems Engineering 29:4, pages 400-411.
Crossref
Andreas Hipp & Victor Fernandez-Viagas. (2019) Influence of no-wait and time lag constraints in flowshop scheduling systems. Influence of no-wait and time lag constraints in flowshop scheduling systems.
Alexandre Lima, Valeria Borodin, Stéphane Dauzère-Pérès & Philippe Vialletelle. (2019) Sampling-based release control of multiple lots in time constraint tunnels. Computers in Industry 110, pages 3-11.
Crossref
Hyun-Jung Kim & Jun-Ho Lee. (2019) Three-machine flow shop scheduling with overlapping waiting time constraints. Computers & Operations Research 101, pages 93-102.
Crossref
Ning Zhou, Menghan Wu & Jianxin Zhou. (2018) Research On Power Battery Formation Production Scheduling Problem With Limited Waiting Time Constraints. Research On Power Battery Formation Production Scheduling Problem With Limited Waiting Time Constraints.
Bailin Wang, Kai Huang & Tieke Li. (2018) Permutation flowshop scheduling with time lag constraints and makespan criterion. Computers & Industrial Engineering 120, pages 1-14.
Crossref
Jun-Ho Lee, Jingshan Li & John A. Horst. (2018) Serial production lines with waiting time limits: Bernoulli reliability model. IEEE Transactions on Engineering Management 65:2, pages 316-329.
Crossref
ChunRong Pan, MengChu Zhou, Yan Qiao & NaiQi Wu. (2018) Scheduling Cluster Tools in Semiconductor Manufacturing: Recent Advances and Challenges. IEEE Transactions on Automation Science and Engineering 15:2, pages 586-601.
Crossref
Hyun-Jung Kim & Jun-Ho Lee. (2017) A Branch and Bound Algorithm for Three-Machine Flow Shop with Overlapping Waiting Time Constraints * *This work was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2016R1D1A1B03930952), and supported by Konkuk University in 2017 (Corresponding author: Jun-Ho Lee). IFAC-PapersOnLine 50:1, pages 1101-1105.
Crossref
Young-Jin An, Yeong-Dae Kim & Seong-Woo Choi. (2016) Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times. Computers & Operations Research 71, pages 127-136.
Crossref
Tae-Sun Yu, Hyun-Jung Kim, Chanhwi Jung & Tae-Eog Lee. (2013) Two-stage lot scheduling with waiting time constraints and due dates. Two-stage lot scheduling with waiting time constraints and due dates.
Emna Dhouib, Jacques Teghem, Daniel Tuyttens & Taïcir Loukil. 2013. Metaheuristics for Production Scheduling. Metaheuristics for Production Scheduling 69 96 .
E. Dhouib, J. Teghem & T. Loukil. (2013) Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints. International Transactions in Operational Research 20:2, pages 213-232.
Crossref
Frank S. Yao, Mei Zhao & Hui Zhang. (2012) Two-stage hybrid flow shop scheduling with dynamic job arrivals. Computers & Operations Research 39:7, pages 1701-1712.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.