ORDER ACCEPTANCE, SCHEDULING AND PRICING MODEL FOR UNRELATED PARALLEL MACHINES WITH CONTROLLABLE PROCESSING TIME

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.

Esfandiari Sahebe; MASHREGHI HAMID; EMAMI SAEED

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING
Year:2017 | Issue:13

Download Full-Text

View:

139

Download:

101

Information Seminar Paper

Title

ORDER ACCEPTANCE, SCHEDULING AND PRICING MODEL FOR UNRELATED PARALLEL MACHINES WITH CONTROLLABLE PROCESSING TIME

Author(s)

Esfandiari Sahebe | MASHREGHI HAMID | EMAMI SAEED

Keywords

ORDER ACCEPTANCE

SCHEDULING AND PRICING (OAS)

PRICING

MAKE-TO-ORDER (MTO) ENVIRONMENT

UNRELATED PARALLEL MACHINE

Abstract

THE MAIN SCHEDULING PROBLEMS IN THE LITERATURE HAVE FOCUSED ON ANALYZING THE PROBLEM OF ORGANIZING MACHINES AND PRODUCTION CAPABILITIES IN AN ENVIRONMENT WITH FIXED SELLING PRICE. HOWEVER, IN A MAKE-TO-ORDER (MTO) ENVIRONMENT THE ASSUMPTION OF PRICING CAN BE FOLLOWED IN AN INTERFACE WITH SCHEDULING PROBLEM. IN THIS RESEARCH WE FIRST REVIEW THE EXISTENCE LITERATURE OF ORDER ACCEPTANCE AND SCHEDULING IN PARTICULAR IN A MTO ENVIRONMENT. USING AN OASP PROBLEM, THE ORDERS ARE CALCULATED BY THEIR CONTROLLABLE PROCESSING TIME, DUE DATE, DEADLINE, RELEASE DATE AND SEQUENCE DEPENDENT SETUP TIME. THEN UNDER JOINT OPTIMIZATION APPROACH, THE PRICING DECISIONS SET FOR UNRELATED PARALLEL MACHINE ENVIRONMENT. THE OBJECTIVE OF THE PROBLEM IS TO MAXIMIZE THE TOTAL NET PROFIT. THE RESULTS SHOW THAT THE BASIC DEVELOPED PROBLEM CAN SOLVE THE SCHEDULING DECISIONS BASED ON DIFFERENT LEVELS OF PRODUCTS’ PRICED. THUS THE PROBLEM SOLVES THESE TWO CATEGORIES OF DECISIONS SIMULTANEOUSLY.

Cites

No record.

References

No record.

Cite

APA: Copy

Esfandiari, Sahebe, MASHREGHI, HAMID, & EMAMI, SAEED. (2017). ORDER ACCEPTANCE, SCHEDULING AND PRICING MODEL FOR UNRELATED PARALLEL MACHINES WITH CONTROLLABLE PROCESSING TIME. INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING. SID. https://sid.ir/paper/938209/en

Vancouver: Copy

Esfandiari Sahebe, MASHREGHI HAMID, EMAMI SAEED. ORDER ACCEPTANCE, SCHEDULING AND PRICING MODEL FOR UNRELATED PARALLEL MACHINES WITH CONTROLLABLE PROCESSING TIME. 2017. Available from: https://sid.ir/paper/938209/en

IEEE: Copy

Sahebe Esfandiari, HAMID MASHREGHI, and SAEED EMAMI, “ORDER ACCEPTANCE, SCHEDULING AND PRICING MODEL FOR UNRELATED PARALLEL MACHINES WITH CONTROLLABLE PROCESSING TIME,” presented at the INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING. 2017, [Online]. Available: https://sid.ir/paper/938209/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops