Efficient Lagrangian Heuristics for the Two-Stage Flow Shop with Job Dependent Buffer Requirements

Efficient Lagrangian Heuristics for the Two-Stage Flow Shop with Job Dependent Buffer Requirements Full article

Journal

Journal of Discrete Algorithms
ISSN: 1570-8667

Output data

Year: 2018, Number: 52-53, Pages: 143-155 Pages count : 13 DOI: 10.1016/j.jda.2018.11.011.

Tags

Flow shop, Buffer, Total weighted completion time, Lagrangian relaxation, NP-hardness

Authors

Gu Hanyu ² , Kononov Alexander Veniaminovich ¹ , Memar Julia ² , Zinder Yakov ²

Affiliations

1	Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
2	University of Technology, Sydney, PO Box 123, Broadway, NSW, 2007, Australia

Gu H. , Kononov A.V. , Memar J. , Zinder Y.
Efficient Lagrangian Heuristics for the Two-Stage Flow Shop with Job Dependent Buffer Requirements
Journal of Discrete Algorithms. 2018. N52-53. P.143-155. DOI: 10.1016/j.jda.2018.11.011.

No identifiers

Пока нет цитирований