PROPOSING A MATHEMATICAL MODEL AND LOWER BOUND FOR ERGONOMIC JOB ROTATION SCHEDULING PROBLEM

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.

BEHNAMIAN JAVAD; AKHAVAN ZEINAB

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES Year:2018 | Volume:16 | Issue:50 Page(s): 105-124

Download Full-Text

Persian Verion

View:

634

Download:

Cites:

Information Journal Paper

Title

PROPOSING A MATHEMATICAL MODEL AND LOWER BOUND FOR ERGONOMIC JOB ROTATION SCHEDULING PROBLEM

Author(s)

BEHNAMIAN JAVAD | AKHAVAN ZEINAB | Issue Writer Certificate

Keywords

JOB ROTATIONQ1

ERGONOMIC JOB ROTATION SCHEDULINGQ1

LOWER BOUNDQ1

PARALLEL MACHINE SCHEDULINGQ1

Abstract

Work in industrial workshops and heavy activities has effects on the health of workers and in terms of occupational hazards associated with many risks for them. Since in the industrial units there are different works in terms of ergonomic load and hardship of work, the occupational hazards can be reduced by JOB ROTATION scheduling. In this paper, using reduction approach, the ergonomic JOB ROTATION scheduling problem (EJRP) is reduced to PARALLEL MACHINE SCHEDULING problem so that its exact methods (such as branch and bound method) are used to solve the EJRP. Furthermore, according to the proposed reduction, the LOWER BOUNDs for PARALLEL MACHINE SCHEDULING problem also applied for branch and bound solving method. The main aim of this research is providing an optimal scheduling for JOB ROTATION by applying human factors engineering approach in order to minimize the maximum workload on the staffs

Cites

No record.

References

No record.

Cite

APA: Copy

BEHNAMIAN, JAVAD, & AKHAVAN, ZEINAB. (2018). PROPOSING A MATHEMATICAL MODEL AND LOWER BOUND FOR ERGONOMIC JOB ROTATION SCHEDULING PROBLEM. JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES, 16(50 ), 105-124. SID. https://sid.ir/paper/213161/en

Vancouver: Copy

BEHNAMIAN JAVAD, AKHAVAN ZEINAB. PROPOSING A MATHEMATICAL MODEL AND LOWER BOUND FOR ERGONOMIC JOB ROTATION SCHEDULING PROBLEM. JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES[Internet]. 2018;16(50 ):105-124. Available from: https://sid.ir/paper/213161/en

IEEE: Copy

JAVAD BEHNAMIAN, and ZEINAB AKHAVAN, “PROPOSING A MATHEMATICAL MODEL AND LOWER BOUND FOR ERGONOMIC JOB ROTATION SCHEDULING PROBLEM,” JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES, vol. 16, no. 50 , pp. 105–124, 2018, [Online]. Available: https://sid.ir/paper/213161/en

Related Journal Papers