SOLVING MANPOWER SCHEDULING PROBLEMS BY USING SIMULATED ANNEALING

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.

TAVAKOLI MOGHADAM R.; RABANI M.; TAGHAVI S.M.

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN) Year:2005 | Volume:16 | Issue:2 Page(s): 1-11

Download Full-Text

Persian Verion

View:

1,127

Download:

Cites:

Information Journal Paper

Title

SOLVING MANPOWER SCHEDULING PROBLEMS BY USING SIMULATED ANNEALING

Author(s)

TAVAKOLI MOGHADAM R. | RABANI M. | TAGHAVI S.M. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

In most service and production systems, there is a need of planning and scheduling the multi-shifts work. This paper presents a manpower scheduling problem in order to assign a work pattern (shift-day) considering system and workforce requirements. The objective is to minimize all cost incurred in the proposed mathematical model. This problem belongs to the class of NP-complete ones due to its time complexity function that it cannot be solved by traditional optimization methods in a reasonable computational time. For this reason, a number of heuristic methods have been proposed to solve such a hard problem. In this paper, a heuristic-based simulated annealing is designed and applied. A number of test problems are generated at random and the associated solutions are compared with the Lingo 6 software in order to evaluate and show efficiency of the proposed algorithm.

Cites

No record.

References

No record.

Cite

APA: Copy

TAVAKOLI MOGHADAM, R., RABANI, M., & TAGHAVI, S.M.. (2005). SOLVING MANPOWER SCHEDULING PROBLEMS BY USING SIMULATED ANNEALING. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 16(2), 1-11. SID. https://sid.ir/paper/65368/en

Vancouver: Copy

TAVAKOLI MOGHADAM R., RABANI M., TAGHAVI S.M.. SOLVING MANPOWER SCHEDULING PROBLEMS BY USING SIMULATED ANNEALING. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2005;16(2):1-11. Available from: https://sid.ir/paper/65368/en

IEEE: Copy

R. TAVAKOLI MOGHADAM, M. RABANI, and S.M. TAGHAVI, “SOLVING MANPOWER SCHEDULING PROBLEMS BY USING SIMULATED ANNEALING,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 16, no. 2, pp. 1–11, 2005, [Online]. Available: https://sid.ir/paper/65368/en

Related Journal Papers