Publication detail

Job Shop Scheduling and Its Fuzzification Based on Operations and Disjunctive Graph Representations

ŠEDA, M. ŠEDA, P. ŠEDOVÁ, J.

Original Title

Job Shop Scheduling and Its Fuzzification Based on Operations and Disjunctive Graph Representations

English Title

Job Shop Scheduling and Its Fuzzification Based on Operations and Disjunctive Graph Representations

Type

conference paper

Language

en

Original Abstract

In this paper, several approaches to job shop scheduling problem are presented. A mixed integer programming model is derived and, based on this result, it is implemented in the GAMS optimisation software tool. Since the problem is NPhard, this approach may not be used for large instances, its reasonable bounds are indicated using benchmarks from ORLibrary. Here, strategies based on operations and disjunctive graph representations are applied and their time complexities are derived. These representations are also used to heuristically generate feasible solutions from their searching space. Finally, a modification is described of the problem using uncertain processing times of jobs based on fuzzy numbers. Methods for comparing fuzzy numbers are then discussed.

English abstract

In this paper, several approaches to job shop scheduling problem are presented. A mixed integer programming model is derived and, based on this result, it is implemented in the GAMS optimisation software tool. Since the problem is NPhard, this approach may not be used for large instances, its reasonable bounds are indicated using benchmarks from ORLibrary. Here, strategies based on operations and disjunctive graph representations are applied and their time complexities are derived. These representations are also used to heuristically generate feasible solutions from their searching space. Finally, a modification is described of the problem using uncertain processing times of jobs based on fuzzy numbers. Methods for comparing fuzzy numbers are then discussed.

Keywords

job shop, mixed integer programming, disjunctive graph, CPM, heuristic, fuzzy number

Released

28.10.2019

Location

Dublin

ISBN

978-1-7281-5763-4

Book

2019 11th International Congress on Ultra Modern Telecommunications and Control Systems (ICUMT)

Pages from

161

Pages to

165

Pages count

5

BibTex


@inproceedings{BUT159902,
  author="Miloš {Šeda} and Pavel {Šeda} and Jindřiška {Šedová}",
  title="Job Shop Scheduling and Its Fuzzification Based on
Operations and Disjunctive Graph Representations",
  annote="In this paper, several approaches to job shop scheduling problem are presented. A mixed integer programming model is derived and, based on this result, it is implemented in the GAMS optimisation software tool. Since the problem is NPhard, this approach may not be used for large instances, its reasonable bounds are indicated using benchmarks from ORLibrary. Here, strategies based on operations and disjunctive graph representations are applied and their time complexities are derived. These representations are also used to heuristically generate feasible solutions from their searching space. Finally, a modification is described of the problem using uncertain processing times of jobs based on fuzzy numbers. Methods for comparing fuzzy numbers are then discussed.",
  booktitle="2019 11th International Congress on Ultra Modern Telecommunications and Control Systems (ICUMT)",
  chapter="159902",
  howpublished="online",
  year="2019",
  month="october",
  pages="161--165",
  type="conference paper"
}