Probl. Upr., 2010, Issue 3, Pages 17–25
This article is cited in 2 scientific papers (total in 2 papers)
Mathematical problems of control theory
Solution of the generalized johnson problem with constraints on the schedule and time of the machine. Part 1. Exact solution methods
Yu. A. Zak
European Centre for Mechatronics Reutershagweg
The problem of finding an optimal permutation which determines the sequence of a set of tasks in a fixed and equal for all tasks sequence of execution of certain works on different machines, is generalized to the case when the restrictions on the start and end time both for execution of individual tasks, and the time of equipment work are set. The properties of admissible and optimal sequence of tasks are studied. The formulas for calculating the lower limit of the total length of the schedule are presented. Exact and approximate methods for solving the problem are developed.
flow-shop problem, optimal schedule, the sequence of assignments, restrictions on the start and end time.
PDF file (913 kB)
Yu. A. Zak, “Solution of the generalized johnson problem with constraints on the schedule and time of the machine. Part 1. Exact solution methods”, Probl. Upr., 2010, no. 3, 17–25
Citation in format AMSBIB
\paper Solution of the generalized johnson problem with constraints on the schedule and time of the machine. Part~1. Exact solution methods
\jour Probl. Upr.
Citing articles on Google Scholar:
Related articles on Google Scholar:
Cycle of papers
This publication is cited in the following articles:
Yu. A. Zak, “Reshenie obobschennoi zadachi Dzhonsona s ogranicheniyami na sroki vypolneniya zadanii i vremena raboty mashin. Ch. 2. Priblizhennye metody resheniya”, Probl. upravl., 4 (2010), 12–19
Yu. A. Zak, “Postroenie raspisanii vypolneniya zadanii dlya parallelno rabotayuschikh sistem mashin i potochnykh linii”, Probl. upravl., 6 (2013), 62–70
|Number of views:|