This article is cited in 1 scientific paper (total in 1 paper)
On properties of optimal schedules in the flow shop problem with preemption and an arbitrary regular criterion
D. A. Chemisova
S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
We investigate the properties of optimal solutions of the NP-hard flow shop scheduling problem with preemption and an arbitrary regular objective function. It is shown that for any instance of the problem its optimal solution can be found by choosing appropriate job priority orders on each machine. The number of preemptions in such schedule is estimated from above. It is also shown that the length of the optimal schedule (for a specified regular criterion) is always equal to the total length of operations from a certain subset. The results of the paper significantly extend previously known results established for the flow shop problem with the minimum makespan objective. Il. 5, bibl. 10.
theory of scheduling, preemption, optimal schedule, regular criterion.
PDF file (349 kB)
D. A. Chemisova, “On properties of optimal schedules in the flow shop problem with preemption and an arbitrary regular criterion”, Diskretn. Anal. Issled. Oper., 16:3 (2009), 74–98
Citation in format AMSBIB
\paper On properties of optimal schedules in the flow shop problem with preemption and an arbitrary regular criterion
\jour Diskretn. Anal. Issled. Oper.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
Sevastyanov S.V., Chemisova D.A., Chernykh I.D., “On Some Properties of Optimal Schedules in the Job Shop Problem with Preemption and an Arbitrary Regular Criterion”, Ann. Oper. Res., 213:1 (2014), 253–270
|Number of views:|