REACTIVE SCHEDULING PRESENTATION FOR AN OPEN SHOP PROBLEM FOCUSED ON JOB'S DUE DATES

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.

TAGHI NEZHAD NEMAT ALLAH; NASSERI SEYED HADI; TALESHIAN JELODAR FATEMEH; KHALILI FARZANEH

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

Journal Paper

Paper Information

Journal: PRODUCTION AND OPERATIONS MANAGEMENT Year:2016 | Volume:6 | Issue:2 (11) Page(s): 95-112

Download Full-Text

Persian Verion

View:

668

Download:

Cites:

Information Journal Paper

Title

REACTIVE SCHEDULING PRESENTATION FOR AN OPEN SHOP PROBLEM FOCUSED ON JOB'S DUE DATES

Author(s)

TAGHI NEZHAD NEMAT ALLAH | NASSERI SEYED HADI | TALESHIAN JELODAR FATEMEH | KHALILI FARZANEH | Issue Writer Certificate

Keywords

REACTIVE PROGRAMMINGQ2

OPEN SHOPQ2

SCHEDULINGQ1

DUE DATEQ2

UNCERTAINTYQ1

Abstract

scheduling consists of assignment resources in order to perform a set of tasks in a given time horizon, that optimizes the usage of available resources. Most of researches in OPEN SHOP district (area) have stationary and certain status, means the situation that all data are certain and won't change in time horizon. Whereas real world SCHEDULING problems are rarely stationary and certain. REACTIVE PROGRAMMING is a researching district that considers and peruses each changes and uncertain assumptions in real world SCHEDULING problems, so in this paper, first we express a mixed integer programming model to produce initial SCHEDULING for OPEN SHOP problem, in continue we will generalize the presented model to its equivalent REACTIVE PROGRAMMING with DUE DATE's changing. Finally we will express an algorithm due to necessity for revise the primal SCHEDULING. This algorithm and whole models have been implemented and ran in AIMMS software environment and the computational results have been reported.

Cites

No record.

References

No record.

Cite

APA: Copy

TAGHI NEZHAD, NEMAT ALLAH, NASSERI, SEYED HADI, TALESHIAN JELODAR, FATEMEH, & KHALILI, FARZANEH. (2016). REACTIVE SCHEDULING PRESENTATION FOR AN OPEN SHOP PROBLEM FOCUSED ON JOB'S DUE DATES. PRODUCTION AND OPERATIONS MANAGEMENT, 6(2 (11) ), 95-112. SID. https://sid.ir/paper/217516/en

Vancouver: Copy

TAGHI NEZHAD NEMAT ALLAH, NASSERI SEYED HADI, TALESHIAN JELODAR FATEMEH, KHALILI FARZANEH. REACTIVE SCHEDULING PRESENTATION FOR AN OPEN SHOP PROBLEM FOCUSED ON JOB'S DUE DATES. PRODUCTION AND OPERATIONS MANAGEMENT[Internet]. 2016;6(2 (11) ):95-112. Available from: https://sid.ir/paper/217516/en

IEEE: Copy

NEMAT ALLAH TAGHI NEZHAD, SEYED HADI NASSERI, FATEMEH TALESHIAN JELODAR, and FARZANEH KHALILI, “REACTIVE SCHEDULING PRESENTATION FOR AN OPEN SHOP PROBLEM FOCUSED ON JOB'S DUE DATES,” PRODUCTION AND OPERATIONS MANAGEMENT, vol. 6, no. 2 (11) , pp. 95–112, 2016, [Online]. Available: https://sid.ir/paper/217516/en

Related Journal Papers