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

journal article - other

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. 12. 2007

ISBN

1307-6906

Periodical

International Journal of Applied Mathematics and Computer Science

Year of study

4

Number

4

State

Republic of Turkey

Pages from

241

Pages to

246

Pages count

6

BibTex

@article{BUT45314,
  author="Miloš {Šeda}",
  title="Mathematical Models of Flow Shop and Job Shop Scheduling Problems",
  journal="International Journal of Applied Mathematics and Computer Science",
  year="2007",
  volume="4",
  number="4",
  pages="241--246",
  issn="1307-6906"
}