The Comparison of the Integer Programming Models for Solving the Stage Shop Scheduling Problem

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.

NASIRI MOHAMMAD MAHDI

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

Journal Paper

Paper Information

Journal: Modeling in Engineering Year:2018 | Volume:16 | Issue:53 Page(s): 379-387

Download Full-Text

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

Persian Verion

View:

373

Download:

Cites:

Information Journal Paper

Title

The Comparison of the Integer Programming Models for Solving the Stage Shop Scheduling Problem

Author(s)

NASIRI MOHAMMAD MAHDI | Issue Writer Certificate

Keywords

stage shopQ1

schedulingQ1

total weighted tardinessQ1

job shop problemQ1

Abstract

The development and extending the classic models for approaching the real world conditions are always in consideration of researchers. For this reason, many efforts are made for generalization of the job shop scheduling problem. The stage shop scheduling problem is defined as a generalization of the mixed shop and a special case of the general shop. In a stage shop, each job includes several stages and each stage contains one or more operations. A stage is a subset of the set of the operations of a job so that these operations can be processed in any arbitrary order. In other words, the process of the operations of a stage cannot be initiated unless all the operations of the previous stage are completed. In this paper, two mixed integer programming models are presented for each of the problems "the stage shop scheduling with total weighted tardiness criterion" and "the stage shop scheduling with makespan criterion" (totally four models) and then the models are compared. For the comparison of the efficiency of the proposed models, some problem instances are generated. The computational results show that the second model is more efficient.

Cites

No record.

References

No record.

Cite

APA: Copy

NASIRI, MOHAMMAD MAHDI. (2018). The Comparison of the Integer Programming Models for Solving the Stage Shop Scheduling Problem. JOURNAL OF MODELING IN ENGINEERING, 16(53 ), 379-387. SID. https://sid.ir/paper/357849/en

Vancouver: Copy

NASIRI MOHAMMAD MAHDI. The Comparison of the Integer Programming Models for Solving the Stage Shop Scheduling Problem. JOURNAL OF MODELING IN ENGINEERING[Internet]. 2018;16(53 ):379-387. Available from: https://sid.ir/paper/357849/en

IEEE: Copy

MOHAMMAD MAHDI NASIRI, “The Comparison of the Integer Programming Models for Solving the Stage Shop Scheduling Problem,” JOURNAL OF MODELING IN ENGINEERING, vol. 16, no. 53 , pp. 379–387, 2018, [Online]. Available: https://sid.ir/paper/357849/en

Related Journal Papers