An application of immune algorithms for job-shop scheduling problems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

Abstract

Job-shop scheduling problems (JSSPs) are important problems that decide production scheduling. However these problems are not easy to solve and many studies have been done. Furthermore, in real situation, while doing jobs according to decided schedule, re-scheduling occurs because of new jobs and it is required to decide the schedule considering ability and skills of works. In this study, in the stage of the deciding the JSSPs, we will discuss the method to offer the designer several candidates of the JSP and then designers can select the final schedule considering the difficult properties to formulate the problems. Through some numerical examples, we will confirm the effectiveness of the proposed method.

Original languageEnglish
Title of host publicationProceedings of the IEEE International Symposium on Assembly and Task Planning
PublisherIEEE Computer Society
Pages146-150
Number of pages5
Volume2003-January
ISBN (Print)0780377702
DOIs
Publication statusPublished - 2003
Externally publishedYes
Event5th IEEE International Symposium on Assembly and Task Planning, ISATP 2003 - Besancon, France
Duration: 2003 Jul 102003 Jul 11

Other

Other5th IEEE International Symposium on Assembly and Task Planning, ISATP 2003
CountryFrance
CityBesancon
Period03/7/1003/7/11

Fingerprint

Scheduling
Job shop scheduling

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering
  • Industrial and Manufacturing Engineering
  • Computer Science Applications

Cite this

Miyashita, T. (2003). An application of immune algorithms for job-shop scheduling problems. In Proceedings of the IEEE International Symposium on Assembly and Task Planning (Vol. 2003-January, pp. 146-150). [1217202] IEEE Computer Society. https://doi.org/10.1109/ISATP.2003.1217202

An application of immune algorithms for job-shop scheduling problems. / Miyashita, Tomoyuki.

Proceedings of the IEEE International Symposium on Assembly and Task Planning. Vol. 2003-January IEEE Computer Society, 2003. p. 146-150 1217202.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Miyashita, T 2003, An application of immune algorithms for job-shop scheduling problems. in Proceedings of the IEEE International Symposium on Assembly and Task Planning. vol. 2003-January, 1217202, IEEE Computer Society, pp. 146-150, 5th IEEE International Symposium on Assembly and Task Planning, ISATP 2003, Besancon, France, 03/7/10. https://doi.org/10.1109/ISATP.2003.1217202
Miyashita T. An application of immune algorithms for job-shop scheduling problems. In Proceedings of the IEEE International Symposium on Assembly and Task Planning. Vol. 2003-January. IEEE Computer Society. 2003. p. 146-150. 1217202 https://doi.org/10.1109/ISATP.2003.1217202
Miyashita, Tomoyuki. / An application of immune algorithms for job-shop scheduling problems. Proceedings of the IEEE International Symposium on Assembly and Task Planning. Vol. 2003-January IEEE Computer Society, 2003. pp. 146-150
@inproceedings{22a09ccb81ce4e98803c039d948684f8,
title = "An application of immune algorithms for job-shop scheduling problems",
abstract = "Job-shop scheduling problems (JSSPs) are important problems that decide production scheduling. However these problems are not easy to solve and many studies have been done. Furthermore, in real situation, while doing jobs according to decided schedule, re-scheduling occurs because of new jobs and it is required to decide the schedule considering ability and skills of works. In this study, in the stage of the deciding the JSSPs, we will discuss the method to offer the designer several candidates of the JSP and then designers can select the final schedule considering the difficult properties to formulate the problems. Through some numerical examples, we will confirm the effectiveness of the proposed method.",
author = "Tomoyuki Miyashita",
year = "2003",
doi = "10.1109/ISATP.2003.1217202",
language = "English",
isbn = "0780377702",
volume = "2003-January",
pages = "146--150",
booktitle = "Proceedings of the IEEE International Symposium on Assembly and Task Planning",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - An application of immune algorithms for job-shop scheduling problems

AU - Miyashita, Tomoyuki

PY - 2003

Y1 - 2003

N2 - Job-shop scheduling problems (JSSPs) are important problems that decide production scheduling. However these problems are not easy to solve and many studies have been done. Furthermore, in real situation, while doing jobs according to decided schedule, re-scheduling occurs because of new jobs and it is required to decide the schedule considering ability and skills of works. In this study, in the stage of the deciding the JSSPs, we will discuss the method to offer the designer several candidates of the JSP and then designers can select the final schedule considering the difficult properties to formulate the problems. Through some numerical examples, we will confirm the effectiveness of the proposed method.

AB - Job-shop scheduling problems (JSSPs) are important problems that decide production scheduling. However these problems are not easy to solve and many studies have been done. Furthermore, in real situation, while doing jobs according to decided schedule, re-scheduling occurs because of new jobs and it is required to decide the schedule considering ability and skills of works. In this study, in the stage of the deciding the JSSPs, we will discuss the method to offer the designer several candidates of the JSP and then designers can select the final schedule considering the difficult properties to formulate the problems. Through some numerical examples, we will confirm the effectiveness of the proposed method.

UR - http://www.scopus.com/inward/record.url?scp=6344234694&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=6344234694&partnerID=8YFLogxK

U2 - 10.1109/ISATP.2003.1217202

DO - 10.1109/ISATP.2003.1217202

M3 - Conference contribution

AN - SCOPUS:6344234694

SN - 0780377702

VL - 2003-January

SP - 146

EP - 150

BT - Proceedings of the IEEE International Symposium on Assembly and Task Planning

PB - IEEE Computer Society

ER -