Publication detail

Mathematical Models of Flow Shop and Job Shop Scheduling Problems

ŠEDA, M.

English title

Mathematical Models of Flow Shop and Job Shop Scheduling Problems

Type

Peer-reviewed article not indexed in WoS or Scopus

Language

en

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 in English

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

Released

2007-12-01

ISSN

1307-6906

Volume

4

Number

4

Pages from–to

241–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"
}