DISCRETE PARTICLE SWARM OPTIMIZATION FOR JOB SHOP SCHEDULING PROBLEM WITH PARALLEL MACHINE

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.

SHAYANIAN MASOUD; BEHNAMIAN JAVAD

مرکز اطلاعات علمی 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:2017 | Volume:28 | Issue:1 Page(s): 15-26

Download Full-Text

Persian Verion

View:

1,143

Download:

Cites:

Information Journal Paper

Title

DISCRETE PARTICLE SWARM OPTIMIZATION FOR JOB SHOP SCHEDULING PROBLEM WITH PARALLEL MACHINE

Author(s)

SHAYANIAN MASOUD | BEHNAMIAN JAVAD | Issue Writer Certificate

Keywords

JOB SHOP SCHEDULINGQ2

PARALLEL MACHINESQ1

METAHEURISTICQ2

PARTICLE SWARM OPTIMIZATIONQ1

Abstract

Since the production scheduling is covered the wide range of manufacturing and services systems, the types of related issues are highly diverse. In advanced manufacturing environments, because the production flexibility property is taking into account as a competitive advantage, in this paper a special kind of flexibility in the JOB SHOP SCHEDULING problem is defined in which, for jobs processing, each workstation have multiple PARALLEL MACHINES. Processing speed of each machine can also be different. The objective of this problem is to minimize the maximum completion time (makespan). Due to NPhardness of problem, we proposed a METAHEURISTIC algorithm. In the proposed approach, due to the structure of the problem and its discrete enviorment, we modified a PARTICLE SWARM OPTIMIZATION as a new discrete algorithm. Finally to evaluate the performance of the algorithm, the proposed algorithm has been compared with several heuristics existing in the literature.

Cites

No record.

References

No record.

Cite

APA: Copy

SHAYANIAN, MASOUD, & BEHNAMIAN, JAVAD. (2017). DISCRETE PARTICLE SWARM OPTIMIZATION FOR JOB SHOP SCHEDULING PROBLEM WITH PARALLEL MACHINE. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 28(1 ), 15-26. SID. https://sid.ir/paper/65627/en

Vancouver: Copy

SHAYANIAN MASOUD, BEHNAMIAN JAVAD. DISCRETE PARTICLE SWARM OPTIMIZATION FOR JOB SHOP SCHEDULING PROBLEM WITH PARALLEL MACHINE. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2017;28(1 ):15-26. Available from: https://sid.ir/paper/65627/en

IEEE: Copy

MASOUD SHAYANIAN, and JAVAD BEHNAMIAN, “DISCRETE PARTICLE SWARM OPTIMIZATION FOR JOB SHOP SCHEDULING PROBLEM WITH PARALLEL MACHINE,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 28, no. 1 , pp. 15–26, 2017, [Online]. Available: https://sid.ir/paper/65627/en

Related Journal Papers