Sciact
  • EN
  • RU

Relocation scheduling subject to fixed processing sequences Full article

Journal Journal of Scheduling
ISSN: 1094-6136
Output data Year: 2015, Volume: 19, Number: 2, Pages: 153-163 Pages count : 11 DOI: 10.1007/s10951-015-0455-8
Tags Relocation problem · Resource-constrained scheduling · Parallel dedicated machines · Fixed sequence · Dynamic programming · NP-hardness
Authors Lin Bertrand M.T. 1 , Hwang F.J. 3 , Kononov Alexander V. 2
Affiliations
1 Department of Information Management and Finance, Institute of Information Management, National Chiao Tung University, Hsinchu, Taiwan
2 3 Sobolev Institute of Mathematics, Novosibirsk, Russia
3 School of Mathematical and Physical Sciences, University of Technology Sydney, Ultimo, Australia
Cite: Lin B.M.T. , Hwang F.J. , Kononov A.V.
Relocation scheduling subject to fixed processing sequences
Journal of Scheduling. 2015. V.19. N2. P.153-163. DOI: 10.1007/s10951-015-0455-8 WOS Scopus OpenAlex
Identifiers:
Web of science: WOS:000372875000003
Scopus: 2-s2.0-84944691604
OpenAlex: W2192809410
Citing:
DB Citing
Scopus 8
OpenAlex 8
Web of science 8
Altmetrics: