Publication detail

Mathematical Models of Flow Shop and Job Shop Scheduling Problems

ŠEDA, M.

Original Title

Mathematical Models of Flow Shop and Job Shop Scheduling Problems

Type

conference paper

Language

English

Original Abstract

In this paper, mathematical models for permutation flow shop scheduling and job shop scheduling problems are proposed. The first problem is based on a mixed integer programming model. As the problem is NP-complete, this model can only be used for smaller instances where an optimal solution can be computed. For large instances, another model is proposed which is suitable for solving the problem by stochastic heuristic methods. For the job shop scheduling problem, a mathematical model and its main representation schemes are presented.

Keywords

flow shop, job shop, mixed integer model, representation scheme

Authors

ŠEDA, M.

RIV year

2007

Released

1. 11. 2007

Publisher

WASET

Location

Venezia (Italy)

Pages from

122

Pages to

127

Pages count

6

BibTex

@inproceedings{BUT25275,
  author="Miloš {Šeda}",
  title="Mathematical Models of Flow Shop and Job Shop Scheduling Problems",
  booktitle="Proceedings of WASET International Conference on Computer, Electrical and Systems Science, and Engineering CESSE 2007",
  year="2007",
  pages="122--127",
  publisher="WASET",
  address="Venezia (Italy)"
}