Achieving an Optimal Lower Bound for Two Stage Supply Chain Scheduling with Regard to the Different Setup 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.

Saberinasab Javad; SAHRAEIAN RASHED; ROHANINEJAD MOHAMMAD

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

Journal Paper

Paper Information

Journal: Advances in Industrial Engineering Year:2018 | Volume:52 | Issue:3 Page(s): 421-431

Download Full-Text

Persian Verion

View:

361

Download:

Cites:

Information Journal Paper

Title

Achieving an Optimal Lower Bound for Two Stage Supply Chain Scheduling with Regard to the Different Setup Time

Author(s)

Saberinasab Javad | SAHRAEIAN RASHED | ROHANINEJAD MOHAMMAD | Issue Writer Certificate

Keywords

Supply Chain SchedulingQ1

Setup TimeQ1

Batch DeliveryQ1

Lower BoundQ1

Abstract

In this paper, a two-stage supply-chain scheduling problem including manufacturers and distributors will be investigated and modeled. The objective function is to minimize the makespan, which is equivalent to the completion time of the last job to leave the system. A minimum makespan usually implies a good utilization of the machine(s). In this research, serial batching machines do jobs processing and then the jobs will deliver to customers (in the next stage) for further processing. The capacity of each batch is limited. Delivery unit cost of each batch is fixed and independent of the number of jobs in the batch. Processing and Setup Time of jobs are varying according to jobs types. The Setup Time is determined according to jobs type within each batch. The problem has been formulated as a mixed integer-programming model. Finally, a Lower Bound will be provided. Computational experiments demonstrate the performance of new lower band.

Cites

No record.

References

No record.

Cite

APA: Copy

Saberinasab, Javad, SAHRAEIAN, RASHED, & ROHANINEJAD, MOHAMMAD. (2018). Achieving an Optimal Lower Bound for Two Stage Supply Chain Scheduling with Regard to the Different Setup Time. ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 52(3 ), 421-431. SID. https://sid.ir/paper/166459/en

Vancouver: Copy

Saberinasab Javad, SAHRAEIAN RASHED, ROHANINEJAD MOHAMMAD. Achieving an Optimal Lower Bound for Two Stage Supply Chain Scheduling with Regard to the Different Setup Time. ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2018;52(3 ):421-431. Available from: https://sid.ir/paper/166459/en

IEEE: Copy

Javad Saberinasab, RASHED SAHRAEIAN, and MOHAMMAD ROHANINEJAD, “Achieving an Optimal Lower Bound for Two Stage Supply Chain Scheduling with Regard to the Different Setup Time,” ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 52, no. 3 , pp. 421–431, 2018, [Online]. Available: https://sid.ir/paper/166459/en

Related Journal Papers