The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
New Direction to the Scheduling Problem: A Pre-Processing Integer Formulation Approach
|
Author(s): Elias Munapo (North-West University, South Africa)and Olusegun Sunday Ewemooje (Federal University of Technology, Akure, Nigeria)
Copyright: 2021
Pages: 16
Source title:
Research Advancements in Smart Technology, Optimization, and Renewable Energy
Source Author(s)/Editor(s): Pandian Vasant (University of Technology Petronas, Malaysia), Gerhard Weber (Poznan University of Technology, Poland)and Wonsiri Punurai (Mahidol University, Thailand)
DOI: 10.4018/978-1-7998-3970-5.ch004
Purchase
|
Abstract
This chapter presents a new direction to the scheduling problem by exploring the Moore-Hodgson algorithm. This algorithm is used within the context of integer programming to come up with complementarity conditions, more biding constraints, and a strong lower bound for the scheduling problem. With Moore-Hodgson Algorithm, the alternate optimal solutions cannot be easily generated from one optimal solution; however, with integer formulation, this is not a problem. Unfortunately, integer formulations are sometimes very difficult to handle as the number jobs increases. Therefore, the integer formulation presented in this chapter uses infeasibility to verify optimality with branch and bound related algorithms. Thus, the lower bound was obtained using pre-processing and shown to be highly accurate and on its own can be used in those situations where quick scheduling decisions are required.
Related Content
Bhargav Naidu Matcha, Sivakumar Sivanesan, K. C. Ng, Se Yong Eh Noum, Aman Sharma.
© 2023.
60 pages.
|
Lavanya Sendhilvel, Kush Diwakar Desai, Simran Adake, Rachit Bisaria, Hemang Ghanshyambhai Vekariya.
© 2023.
15 pages.
|
Jayanthi Ganapathy, Purushothaman R., Ramya M., Joselyn Diana C..
© 2023.
14 pages.
|
Prince Rajak, Anjali Sagar Jangde, Govind P. Gupta.
© 2023.
14 pages.
|
Mustafa Eren Akpınar.
© 2023.
9 pages.
|
Sreekantha Desai Karanam, Krithin M., R. V. Kulkarni.
© 2023.
34 pages.
|
Omprakash Nayak, Tejaswini Pallapothala, Govind P. Gupta.
© 2023.
19 pages.
|
|
|