Multiple objective scheduling for discrete production system based on compositional dispatching rules

Chen Xili, Lu Yang, Tomohiro Murata

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

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationICIEA 2007: 2007 Second IEEE Conference on Industrial Electronics and Applications
Pages2606-2611
Number of pages6
DOIs
Publication statusPublished - 2007
Event2007 2nd IEEE Conference on Industrial Electronics and Applications, ICIEA 2007 - Harbin
Duration: 2007 May 232007 May 25

Other

Other2007 2nd IEEE Conference on Industrial Electronics and Applications, ICIEA 2007
CityHarbin
Period07/5/2307/5/25

Fingerprint

Scheduling
Heuristic methods

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Xili, C., Yang, L., & Murata, T. (2007). Multiple objective scheduling for discrete production system based on compositional dispatching rules. In ICIEA 2007: 2007 Second IEEE Conference on Industrial Electronics and Applications (pp. 2606-2611). [4318885] https://doi.org/10.1109/ICIEA.2007.4318885

Multiple objective scheduling for discrete production system based on compositional dispatching rules. / Xili, Chen; Yang, Lu; Murata, Tomohiro.

ICIEA 2007: 2007 Second IEEE Conference on Industrial Electronics and Applications. 2007. p. 2606-2611 4318885.

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

Xili, C, Yang, L & Murata, T 2007, Multiple objective scheduling for discrete production system based on compositional dispatching rules. in ICIEA 2007: 2007 Second IEEE Conference on Industrial Electronics and Applications., 4318885, pp. 2606-2611, 2007 2nd IEEE Conference on Industrial Electronics and Applications, ICIEA 2007, Harbin, 07/5/23. https://doi.org/10.1109/ICIEA.2007.4318885
Xili C, Yang L, Murata T. Multiple objective scheduling for discrete production system based on compositional dispatching rules. In ICIEA 2007: 2007 Second IEEE Conference on Industrial Electronics and Applications. 2007. p. 2606-2611. 4318885 https://doi.org/10.1109/ICIEA.2007.4318885
Xili, Chen ; Yang, Lu ; Murata, Tomohiro. / Multiple objective scheduling for discrete production system based on compositional dispatching rules. ICIEA 2007: 2007 Second IEEE Conference on Industrial Electronics and Applications. 2007. pp. 2606-2611
@inproceedings{6253d1440a0341938480f64ca7ad47a0,
title = "Multiple objective scheduling for discrete production system based on compositional dispatching rules",
abstract = "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.",
author = "Chen Xili and Lu Yang and Tomohiro Murata",
year = "2007",
doi = "10.1109/ICIEA.2007.4318885",
language = "English",
isbn = "1424407370",
pages = "2606--2611",
booktitle = "ICIEA 2007: 2007 Second IEEE Conference on Industrial Electronics and Applications",

}

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

Y1 - 2007

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

SN - 1424407370

SN - 9781424407378

SP - 2606

EP - 2611

BT - ICIEA 2007: 2007 Second IEEE Conference on Industrial Electronics and Applications

ER -