TY - GEN
T1 - Multiple objective scheduling for discrete production system based on compositional dispatching rules
AU - Xili, Chen
AU - Yang, Lu
AU - Murata, Tomohiro
PY - 2007/10/18
Y1 - 2007/10/18
N2 - The multiple objective scheduling problem (MOSP) becomes focus in recent years in actual manufacturing system. The most practical way to solve MOSP is using dispatching rule combination based on simulation evaluation. It mostly combines particular dispatching rules with linear manner corresponding to multiple scheduling objectives, however it is difficult to determine what combination of dispatching rules is effective to achieve multiple scheduling objectives and also to adapt compositional dispatching rules to change of scheduling objective. This paper presents a new heuristic method to deal MOSP based on unified ranking measure of the job priority with multiple dispatching rules. The priority of jobs regarding to respective dispatching rules are calculated and the unified priority of the job priority is decided by using analytic hierarchical process with adjusted weights corresponding to scheduling objectives. The simulation result demonstrates that the proposed method is feasible and flexible to solve MOSP.
AB - The multiple objective scheduling problem (MOSP) becomes focus in recent years in actual manufacturing system. The most practical way to solve MOSP is using dispatching rule combination based on simulation evaluation. It mostly combines particular dispatching rules with linear manner corresponding to multiple scheduling objectives, however it is difficult to determine what combination of dispatching rules is effective to achieve multiple scheduling objectives and also to adapt compositional dispatching rules to change of scheduling objective. This paper presents a new heuristic method to deal MOSP based on unified ranking measure of the job priority with multiple dispatching rules. The priority of jobs regarding to respective dispatching rules are calculated and the unified priority of the job priority is decided by using analytic hierarchical process with adjusted weights corresponding to scheduling objectives. The simulation result demonstrates that the proposed method is feasible and flexible to solve MOSP.
UR - http://www.scopus.com/inward/record.url?scp=35248864825&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=35248864825&partnerID=8YFLogxK
U2 - 10.1109/ICIEA.2007.4318885
DO - 10.1109/ICIEA.2007.4318885
M3 - Conference contribution
AN - SCOPUS:35248864825
SN - 1424407370
SN - 9781424407378
T3 - ICIEA 2007: 2007 Second IEEE Conference on Industrial Electronics and Applications
SP - 2606
EP - 2611
BT - ICIEA 2007
T2 - 2007 2nd IEEE Conference on Industrial Electronics and Applications, ICIEA 2007
Y2 - 23 May 2007 through 25 May 2007
ER -