Minimizing Makespan with Start Time-Dependent Jobs in a Two-Machine Flow Shop

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.

JAFARI A.A.; KHADEMI ZARE H.; LOTFI M.M.; TAVAKKOLI MOGHADDAM R.

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF ENGINEERING Year:2016 | Volume:29 | Issue:6 (TRANSACTIONS C: Aspects) Page(s): 0-0

Download Full-Text

View:

174

Download:

Cites:

Information Journal Paper

Title

Minimizing Makespan with Start Time-Dependent Jobs in a Two-Machine Flow Shop

Author(s)

JAFARI A.A. | KHADEMI ZARE H. | LOTFI M.M. | TAVAKKOLI MOGHADDAM R. | Issue Writer Certificate

Keywords

Linear Deteriorating Jobs

Start Time-Dependent

Flow Shop

Makespan

Branch and Bound

Heuristics

Abstract

The purpose of this paper is to consider the problem of scheduling a set of Start Time-Dependent jobs in a two-machine Flow Shop, in which the actual processing times of jobs increase linearly according to their starting time. The objective of this problem is to minimize the Makespan. The problem is known to be NP-hardness; therefore, there is no polynomial-time algorithm to solve it optimally in a reasonable time. So, a branch-and-bound algorithm is proposed to find the optimal solution by means of dominance rules, upper and lower bounds. Several easy heuristic procedures are also proposed to derive near-optimal solutions. To evaluate the performance of the proposed algorithms, the computational experiments are extracted based on the recent literature. Deteriorating jobs lead to an increase in the Makespan of the problems; therefore, it is important to obtain the optimal or near-optimal solution. Considering the complexity of the problem, the branch-and-bound algorithm is capable of solving problems of up to 26 jobs. Additionally, the average error percentage of heuristic algorithms is less than 1. 37%; therefore, the best one is recommended to obtain a near-optimal solution for large-scale problems.

Cites

No record.

References

No record.

Cite

APA: Copy

JAFARI, A.A., KHADEMI ZARE, H., LOTFI, M.M., & TAVAKKOLI MOGHADDAM, R.. (2016). Minimizing Makespan with Start Time-Dependent Jobs in a Two-Machine Flow Shop. INTERNATIONAL JOURNAL OF ENGINEERING, 29(6 (TRANSACTIONS C: Aspects)), 0-0. SID. https://sid.ir/paper/734819/en

Vancouver: Copy

JAFARI A.A., KHADEMI ZARE H., LOTFI M.M., TAVAKKOLI MOGHADDAM R.. Minimizing Makespan with Start Time-Dependent Jobs in a Two-Machine Flow Shop. INTERNATIONAL JOURNAL OF ENGINEERING[Internet]. 2016;29(6 (TRANSACTIONS C: Aspects)):0-0. Available from: https://sid.ir/paper/734819/en

IEEE: Copy

A.A. JAFARI, H. KHADEMI ZARE, M.M. LOTFI, and R. TAVAKKOLI MOGHADDAM, “Minimizing Makespan with Start Time-Dependent Jobs in a Two-Machine Flow Shop,” INTERNATIONAL JOURNAL OF ENGINEERING, vol. 29, no. 6 (TRANSACTIONS C: Aspects), pp. 0–0, 2016, [Online]. Available: https://sid.ir/paper/734819/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops