Multi-objective flexible job shop scheduling with uncertain processing time and machine available constraint based on hybrid optimization approach

Tian Jing, Tomohiro Murata

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

3 Citations (Scopus)

Abstract

Scheduling for the flexible job shop is very important in both fields of production management and combinatorial optimization. However, when we attempt to formulate job shop scheduling problems which closely describe and represent the real world problem, various factors involved are often imprecisely or ambiguously known to the analyst. Also, in the real situations, machines are not continuously available due to preventive maintenance activity. Besides, in the production system, there are many users and machines in various priorities. Often, user satisfactions, machine stability and schedule itself are in conflict. By considering the imprecise or fuzzy nature of the data in real world problem, job shop scheduling with uncertain processing time and machine available constraint is introduced. Under the fuzzy circumstance, we attempt to make a feasible solution for flexible job shop scheduling problem (FJSSP) based on a hybrid optimization approach with multi-objective which not only to minimize the makespan, but also maximize the user satisfaction and machine stability. In the experiment, we make the comparisons with some other algorithms, such as genetic algorithm, to demonstrate the hybrid approach is much better on efficient search and stability with three benchmark examples. Sensitivity analysis is conducted to study the impact, in term of total objective, when the proportion of machine stability is varied.

Original languageEnglish
Title of host publication2010 IEEE International Conference on Automation and Logistics, ICAL 2010
Pages581-586
Number of pages6
DOIs
Publication statusPublished - 2010
Event2010 IEEE International Conference on Automation and Logistics, ICAL 2010 - Shatin
Duration: 2010 Aug 162010 Aug 20

Other

Other2010 IEEE International Conference on Automation and Logistics, ICAL 2010
CityShatin
Period10/8/1610/8/20

Fingerprint

Processing
Preventive maintenance
Combinatorial optimization
Sensitivity analysis
Genetic algorithms
Scheduling
Job shop scheduling
Experiments

Keywords

  • Ant colony optimization & tabu search
  • Flexible job shop scheduling
  • Fuzzy processing time
  • Machine available constraints
  • Multi-objective optimization

ASJC Scopus subject areas

  • Control and Systems Engineering

Cite this

Multi-objective flexible job shop scheduling with uncertain processing time and machine available constraint based on hybrid optimization approach. / Jing, Tian; Murata, Tomohiro.

2010 IEEE International Conference on Automation and Logistics, ICAL 2010. 2010. p. 581-586 5585352.

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

Jing, T & Murata, T 2010, Multi-objective flexible job shop scheduling with uncertain processing time and machine available constraint based on hybrid optimization approach. in 2010 IEEE International Conference on Automation and Logistics, ICAL 2010., 5585352, pp. 581-586, 2010 IEEE International Conference on Automation and Logistics, ICAL 2010, Shatin, 10/8/16. https://doi.org/10.1109/ICAL.2010.5585352
@inproceedings{378db4b814c345a2ad4cc4c96912a1a2,
title = "Multi-objective flexible job shop scheduling with uncertain processing time and machine available constraint based on hybrid optimization approach",
abstract = "Scheduling for the flexible job shop is very important in both fields of production management and combinatorial optimization. However, when we attempt to formulate job shop scheduling problems which closely describe and represent the real world problem, various factors involved are often imprecisely or ambiguously known to the analyst. Also, in the real situations, machines are not continuously available due to preventive maintenance activity. Besides, in the production system, there are many users and machines in various priorities. Often, user satisfactions, machine stability and schedule itself are in conflict. By considering the imprecise or fuzzy nature of the data in real world problem, job shop scheduling with uncertain processing time and machine available constraint is introduced. Under the fuzzy circumstance, we attempt to make a feasible solution for flexible job shop scheduling problem (FJSSP) based on a hybrid optimization approach with multi-objective which not only to minimize the makespan, but also maximize the user satisfaction and machine stability. In the experiment, we make the comparisons with some other algorithms, such as genetic algorithm, to demonstrate the hybrid approach is much better on efficient search and stability with three benchmark examples. Sensitivity analysis is conducted to study the impact, in term of total objective, when the proportion of machine stability is varied.",
keywords = "Ant colony optimization & tabu search, Flexible job shop scheduling, Fuzzy processing time, Machine available constraints, Multi-objective optimization",
author = "Tian Jing and Tomohiro Murata",
year = "2010",
doi = "10.1109/ICAL.2010.5585352",
language = "English",
isbn = "9781424483754",
pages = "581--586",
booktitle = "2010 IEEE International Conference on Automation and Logistics, ICAL 2010",

}

TY - GEN

T1 - Multi-objective flexible job shop scheduling with uncertain processing time and machine available constraint based on hybrid optimization approach

AU - Jing, Tian

AU - Murata, Tomohiro

PY - 2010

Y1 - 2010

N2 - Scheduling for the flexible job shop is very important in both fields of production management and combinatorial optimization. However, when we attempt to formulate job shop scheduling problems which closely describe and represent the real world problem, various factors involved are often imprecisely or ambiguously known to the analyst. Also, in the real situations, machines are not continuously available due to preventive maintenance activity. Besides, in the production system, there are many users and machines in various priorities. Often, user satisfactions, machine stability and schedule itself are in conflict. By considering the imprecise or fuzzy nature of the data in real world problem, job shop scheduling with uncertain processing time and machine available constraint is introduced. Under the fuzzy circumstance, we attempt to make a feasible solution for flexible job shop scheduling problem (FJSSP) based on a hybrid optimization approach with multi-objective which not only to minimize the makespan, but also maximize the user satisfaction and machine stability. In the experiment, we make the comparisons with some other algorithms, such as genetic algorithm, to demonstrate the hybrid approach is much better on efficient search and stability with three benchmark examples. Sensitivity analysis is conducted to study the impact, in term of total objective, when the proportion of machine stability is varied.

AB - Scheduling for the flexible job shop is very important in both fields of production management and combinatorial optimization. However, when we attempt to formulate job shop scheduling problems which closely describe and represent the real world problem, various factors involved are often imprecisely or ambiguously known to the analyst. Also, in the real situations, machines are not continuously available due to preventive maintenance activity. Besides, in the production system, there are many users and machines in various priorities. Often, user satisfactions, machine stability and schedule itself are in conflict. By considering the imprecise or fuzzy nature of the data in real world problem, job shop scheduling with uncertain processing time and machine available constraint is introduced. Under the fuzzy circumstance, we attempt to make a feasible solution for flexible job shop scheduling problem (FJSSP) based on a hybrid optimization approach with multi-objective which not only to minimize the makespan, but also maximize the user satisfaction and machine stability. In the experiment, we make the comparisons with some other algorithms, such as genetic algorithm, to demonstrate the hybrid approach is much better on efficient search and stability with three benchmark examples. Sensitivity analysis is conducted to study the impact, in term of total objective, when the proportion of machine stability is varied.

KW - Ant colony optimization & tabu search

KW - Flexible job shop scheduling

KW - Fuzzy processing time

KW - Machine available constraints

KW - Multi-objective optimization

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

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

U2 - 10.1109/ICAL.2010.5585352

DO - 10.1109/ICAL.2010.5585352

M3 - Conference contribution

SN - 9781424483754

SP - 581

EP - 586

BT - 2010 IEEE International Conference on Automation and Logistics, ICAL 2010

ER -