Open Access
| Issue |
BIO Web Conf.
Volume 97, 2024
Fifth International Scientific Conference of Alkafeel University (ISCKU 2024)
|
|
|---|---|---|
| Article Number | 00146 | |
| Number of page(s) | 6 | |
| DOI | https://doi.org/10.1051/bioconf/20249700146 | |
| Published online | 05 April 2024 | |
- M.L. Pinedo, “Scheduling Theory Algorithms, and Systems”, Third Edition. Stern School of Business, New York University, New York. Springer, (2008). [Google Scholar]
- H. Holger. Hoos and S. Thomas, “In the Morgan Kaufmann Series in Artificial Intelligence”, (2005). [Google Scholar]
- I.K. Sun Lee, “A Scheduling Problem to Minimize Total Weighted Tardiness in the Two- Stage Assembly Flowshop”, Mathematical Problems in Engineering, (2020), vol. 2020, Article ID 9723439, 10 pages. [Google Scholar]
- Jinliang Cheng, George Steiner and Paul Stephenson, “Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times”, JOURNAL OF SCHEDULING, (2002); 5:71–92 doi: 10.1002/jos.094. [CrossRef] [Google Scholar]
- Ali Allahverdi, “Three-Machine Flowshop Scheduling Problem to Minimize Total Completion Time with Bounded Setup and Processing Times”, (2007), Decision Making in Manufacturing and Services, Vol. 1, No. 1-2, pp. 5–23. [CrossRef] [Google Scholar]
- Ali Allahverdi, “Three-Machine Flowshop Scheduling Problem to Minimize Makespan WITH Bounded Setup and Processing Times”, Journal of the Chinese Institute of Industrial Engineers, (2008). vol. 25, no. 1, pp. 52–61. [CrossRef] [Google Scholar]
- Lixin Tang and Peng Liu, “Minimizing makespan in a two-machine flowshop scheduling with batching and release time”, Mathematical and Computer Modelling, (March 2009 Volume 49, Issues 5-6, Pages 1071–1077. [CrossRef] [Google Scholar]
- G. Moslehi, M. Mirzaee, M. Vasei, M. Modarres, and A. Azaron, “Two-Machine Flow Shop Scheduling To Minimize the Sum of Maximum Earliness and Tardiness”, (2009), Int. J. Production Economics 122:763–773. [CrossRef] [Google Scholar]
- Ming-Cheng Lo, Jen-Shiang Chen and Yong-Fu Chang, “Minimizing Makespan and Mean Flow Time in Two-Versatile-Machine Flow-Shop with Alternative Operations”, (2010), Information Technology Journal, 9 (2): 257–265. [CrossRef] [Google Scholar]
- N. Shahsavari Pour, R. Tavakkoli-Moghaddam and H. Asadi, “Optimizing a multi- objectives flow shop scheduling problem by a novel genetic algorithm”, International Journal of Industrial Engineering Computations, (2013), 4, 345–354. [CrossRef] [Google Scholar]
- Win-Chin Lin, “Minimizing the Makespan for a Two-Stage Three-Machine Assembly Flow Shop Problem with the Sum-of-Processing-Time Based Learning Effect”, Discrete Dynamics in Nature and Society, (2018), Article ID 8170294, 15 pages https://doi.org/10.1155/2018/8170294. [Google Scholar]
- Dar-Li Yang and Wen-Hung Kuo, “Minimizing Makespan in a Two-Machine Flowshop Problem with Processing Time Linearly Dependent on Job Waiting Time”, Sustainability, (2019), 11(24), 6885; https://doi.org/10.3390/su11246885. [Google Scholar]
- J.A. Hoogeveen, “Single Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria, Journal of Algorithms, (1996), 21:415–433 [CrossRef] [Google Scholar]
- L. Jouni, “Multi-Objective Nonlinear Pareto-Optimization” Lappeenranta University of Technology, (2000). [Google Scholar]
- J.A. Hoogeveen, “Minimizing maximum earliness and maximum lateness on a single machine”, Center for Mathematics and Computer science, (1991), P.O. Box 4079, 1009 AB Amsterdam, The Netherland, [Google Scholar]
- Ibrahim M. Alharkan Algorithms for sequences and scheduling, Saudi Arabia, (2005). [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.