Detail publikace

Mathematical Models of Flow Shop and Job Shop Scheduling Problems

ŠEDA, M.

Originální název

Mathematical Models of Flow Shop and Job Shop Scheduling Problems

Typ

článek v časopise - ostatní, Jost

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

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

Autoři

ŠEDA, M.

Rok RIV

2007

Vydáno

1. 12. 2007

ISSN

1307-6906

Periodikum

International Journal of Applied Mathematics and Computer Science

Ročník

4

Číslo

4

Stát

Turecká republika

Strany od

241

Strany do

246

Strany počet

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