Publication detail

An Implementation View on Job Shop Scheduling Based on CPM

ŠEDA, M.

Original Title

An Implementation View on Job Shop Scheduling Based on CPM

Type

conference paper

Language

English

Original Abstract

The scheduling of manufacturing processes aims to find sequences of jobs on given machines optimal by a selected criterion, e.g. minimal completion time of all operations. With respect to NP-hardness of these problems and the necessity to solve them by heuristic methods, the problem representation and the effectiveness of their procedures is substantial for computations to be completed in a reasonable amount of time. In this paper, we deal with job shop scheduling problem (JSSP) in a disjunctive graph-based representation. Turning all undirected edges into directed ones, the problem is transformed to a problem solvable by the Critical Path Method (CPM). We propose an original implementation of the CPM that makes it possible to decrease its time complexity and thus also the running time of all JSSP iterations.

Keywords

manufacturing process, job shop scheduling, NP-hard problem, disjunctive graph, CPM

Authors

ŠEDA, M.

RIV year

2007

Released

1. 7. 2007

Publisher

WSEAS Press

Location

Crete Island (Greece)

ISBN

978-960-8457-92-8

Book

Proceedings of the 11th WSEAS International Conference on Computers

Pages from

540

Pages to

545

Pages count

6

BibTex

@inproceedings{BUT23385,
  author="Miloš {Šeda}",
  title="An Implementation View on Job Shop Scheduling Based on CPM",
  booktitle="Proceedings of the 11th WSEAS International Conference on Computers",
  year="2007",
  pages="540--545",
  publisher="WSEAS Press",
  address="Crete Island (Greece)",
  isbn="978-960-8457-92-8"
}