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 language | English |
|---|---|
| Title of host publication | Proceedings of the IEEE International Symposium on Assembly and Task Planning |
| Publisher | IEEE Computer Society |
| Pages | 146-150 |
| Number of pages | 5 |
| Volume | 2003-January |
| ISBN (Print) | 0780377702 |
| DOIs | |
| Publication status | Published - 2003 |
| Externally published | Yes |
| Event | 5th IEEE International Symposium on Assembly and Task Planning, ISATP 2003 - Besancon, France Duration: 2003 Jul 10 → 2003 Jul 11 |
Other
| Other | 5th IEEE International Symposium on Assembly and Task Planning, ISATP 2003 |
|---|---|
| Country | France |
| City | Besancon |
| Period | 03/7/10 → 03/7/11 |
Fingerprint
ASJC Scopus subject areas
- Control and Systems Engineering
- Electrical and Electronic Engineering
- Industrial and Manufacturing Engineering
- Computer Science Applications
Cite this
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 proceeding › Conference contribution
}
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 -