Branch & Cut Algorithm for Solving job Shop Scheduling Problem Using Valid Inequalities

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

BEHNAMIAN J.; Komijani F.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS) Year:2019 | Volume:6 | Issue:13 Page(s): 139-149

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

686

Download:

Cites:

Information Journal Paper

Title

Branch & Cut Algorithm for Solving job Shop Scheduling Problem Using Valid Inequalities

Author(s)

BEHNAMIAN J. | Komijani F. | Issue Writer Certificate

Keywords

SchedulingQ2

Job shop problemQ1

Branch and cutQ1

Valid inequalitiesQ1

Abstract

In this paper, the problem of Scheduling the job shop production is considered, which, while being applicable as one of the complex issues in the field of combinatorial optimization, has been raised and this has caused the researchers to pay more attention to this problem. In this problem, given the existence of a number of workshops, the number of jobs should be processed in the workshop with a known production path that is already known. In order to solve this problem, in this paper, the problem of production Scheduling is firstly modeled as a mixed integer programming. Then, due to the limitations of the exact solving using this model, the surface cutting method is proposed to create inequalities this is valid for the problem in the framework of branching and cutting algorithm. The aim of adding this set of inequalities is to create a lower bound, which, while the feasible solutions are not eliminated by them, accelerates the solution in the framework of branch & cut algorithm. To solve the problem optimally, the results show that the lower bound created by the re-formulated model is stronger than the lower bound created by the original relaxed model.

Cites

No record.

References

No record.

Cite

APA: Copy

BEHNAMIAN, J., & Komijani, F.. (2019). Branch & Cut Algorithm for Solving job Shop Scheduling Problem Using Valid Inequalities. JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS), 6(13 ), 139-149. SID. https://sid.ir/paper/241290/en

Vancouver: Copy

BEHNAMIAN J., Komijani F.. Branch & Cut Algorithm for Solving job Shop Scheduling Problem Using Valid Inequalities. JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS)[Internet]. 2019;6(13 ):139-149. Available from: https://sid.ir/paper/241290/en

IEEE: Copy

J. BEHNAMIAN, and F. Komijani, “Branch & Cut Algorithm for Solving job Shop Scheduling Problem Using Valid Inequalities,” JOURNAL OF INDUSTRIAL ENGINEERING RESEARCH IN PRODUCTION SYSTEMS (IERPS), vol. 6, no. 13 , pp. 139–149, 2019, [Online]. Available: https://sid.ir/paper/241290/en

Related Journal Papers