DEVELOPING AN UPPER BOUND AND HEURISTIC SOLUTION ALGORITHM FOR ORDER SCHEDULING PROBLEM WITH MACHINES’ IDLE TIME MINIMIZATION: A CASE STUDY IN PRINTING INDUSTRY

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.

MOKHTARI HADI; NAKHAI KAMALABADI ISA; ZEGORDI SEYED HESSAMEDDIN

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

Journal Paper

Paper Information

Journal: PRODUCTION AND OPERATIONS MANAGEMENT Year:2013 | Volume:3 | Issue:2 (5) Page(s): 41-58

Download Full-Text

Persian Verion

View:

793

Download:

Cites:

Information Journal Paper

Title

DEVELOPING AN UPPER BOUND AND HEURISTIC SOLUTION ALGORITHM FOR ORDER SCHEDULING PROBLEM WITH MACHINES’ IDLE TIME MINIMIZATION: A CASE STUDY IN PRINTING INDUSTRY

Author(s)

MOKHTARI HADI | NAKHAI KAMALABADI ISA | ZEGORDI SEYED HESSAMEDDIN | Issue Writer Certificate

Keywords

ORDER SCHEDULINGQ2

ANALYTICAL SOLUTION APPROACHQ2

UPPER BOUNDQ2

SYMMETRIC ASSIGNMENT PROBLEMQ2

PRINTING INDUSTRYQ2

Abstract

In this paper, the problem of received ORDER SCHEDULING by a manufacturer, with the measure of maximum completion times of orders, has been formulated and then an analytical approach has been devised for its solution. At the beginning of a planning period, the manufacturer receives a number of orders from customers, each of which requires two different stages for processing. In order to minimize the work in process inventories, the no-wait condition between two operations of each order is regarded. Then, the equality of obtained schedules is proved by machine idle time minimization, as objective, with the schedules obtained by maximum completion time minimization. A concept entitled “Order pairing” has been defined and an algorithm for achieving optimal order pairs which is based on SYMMETRIC ASSIGNMENT PROBLEM has been presented. Using the established order pairs, an UPPER BOUND has been developed based on contribution of every order pair out of total machines idle time. Out of different states of improving UPPER BOUND, 12 potential situations of order pairs sequencing have been also evaluated and then the UPPER BOUND improvement has been proved in each situation, separately. Finally, a heuristic algorithm has been developed based on attained results of pair improvement and a case study in PRINTING INDUSTRY has been investigated and analyzed to approve its applicability.

Cites

No record.

References

No record.

Cite

APA: Copy

MOKHTARI, HADI, NAKHAI KAMALABADI, ISA, & ZEGORDI, SEYED HESSAMEDDIN. (2013). DEVELOPING AN UPPER BOUND AND HEURISTIC SOLUTION ALGORITHM FOR ORDER SCHEDULING PROBLEM WITH MACHINES’ IDLE TIME MINIMIZATION: A CASE STUDY IN PRINTING INDUSTRY. PRODUCTION AND OPERATIONS MANAGEMENT, 3(2 (5)), 41-58. SID. https://sid.ir/paper/217609/en

Vancouver: Copy

MOKHTARI HADI, NAKHAI KAMALABADI ISA, ZEGORDI SEYED HESSAMEDDIN. DEVELOPING AN UPPER BOUND AND HEURISTIC SOLUTION ALGORITHM FOR ORDER SCHEDULING PROBLEM WITH MACHINES’ IDLE TIME MINIMIZATION: A CASE STUDY IN PRINTING INDUSTRY. PRODUCTION AND OPERATIONS MANAGEMENT[Internet]. 2013;3(2 (5)):41-58. Available from: https://sid.ir/paper/217609/en

IEEE: Copy

HADI MOKHTARI, ISA NAKHAI KAMALABADI, and SEYED HESSAMEDDIN ZEGORDI, “DEVELOPING AN UPPER BOUND AND HEURISTIC SOLUTION ALGORITHM FOR ORDER SCHEDULING PROBLEM WITH MACHINES’ IDLE TIME MINIMIZATION: A CASE STUDY IN PRINTING INDUSTRY,” PRODUCTION AND OPERATIONS MANAGEMENT, vol. 3, no. 2 (5), pp. 41–58, 2013, [Online]. Available: https://sid.ir/paper/217609/en

Related Journal Papers