Two-Station Single-Track Railway Scheduling Problem With Trains of Equal Speed

Гафаров, Е.Р.; Долгий, А.; Лазарев, А.А.

Статья опубликована в высокорейтинговом журнале

Информация о цитировании статьи получена из Web of Science, Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 9 июня 2016 г.

Авторы: Гафаров Е.Р., Долгий А., Лазарев А.А.
Журнал: Computers and Industrial Engineering
Том: 85
Год издания: 2015
Издательство: Pergamon Press Ltd.
Местоположение издательства: United Kingdom
Первая страница: 260
Последняя страница: 267
DOI: 10.1016/j.cie.2015.03.014
Аннотация: In this paper, the single-track railway scheduling problem with two stations and several segments of the track is considered. Two subsets of trains are given, where trains from the first subset go from the first station to the second station, and trains from the second subset go in the opposite direction. The speed of trains over each segment is the same. A polynomial time reduction from the problem under consideration to a special case of the single-machine equal-processing-time scheduling problem with setup times is presented. Different polynomial time algorithms are developed for special cases with divers objective functions under various constraints. Moreover, several theoretical results which can be ranked in a series of similar investigations of NP-hardness of equal-processing-time single-machine scheduling problems without precedence relations are obtained.
Добавил в систему: Лазарев Александр Алексеевич

	ИСТИНА	Войти в систему Регистрация
	ИПМех РАН
	Главная Поиск Статистика О проекте Помощь

ИСТИНА

ИПМех РАН

Two-Station Single-Track Railway Scheduling Problem With Trains of Equal Speedстатья

Прикрепленные файлы