Please use this identifier to cite or link to this item: https://doi.org/10.1016/S0377-2217(00)00317-9
Title: Rotation cycle schedulings for multi-item production systems
Authors: Chan, G.H. 
Song, Y.
Keywords: Branch and bound algorithm
Rotation cycle
Travelling salesman
Issue Date: 1-Dec-2001
Citation: Chan, G.H., Song, Y. (2001-12-01). Rotation cycle schedulings for multi-item production systems. European Journal of Operational Research 135 (2) : 361-372. ScholarBank@NUS Repository. https://doi.org/10.1016/S0377-2217(00)00317-9
Abstract: Consider the production planning and scheduling on a single machine with finite constant production rate over a planning horizon N. For single-item production problem, we have characterised the structure of the optimal solution when N approaches to infinity. This result suggests a near optimal solution when the planning horizon N is large. For multi-item production problem, we restrict our analysis on the Rotation Cycle policies. Under the assumptions of the policy, we convert the problem into a generalised travelling salesman problem and hence a branch and bound algorithm is proposed to solve the problem. For a given error bound of the solution, the algorithm can be further simplified to determine a near-optimal rotation cycle. © 2001 Published by Elsevier Science B. V.
Source Title: European Journal of Operational Research
URI: http://scholarbank.nus.edu.sg/handle/10635/104069
ISSN: 03772217
DOI: 10.1016/S0377-2217(00)00317-9
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

2
checked on Oct 20, 2018

WEB OF SCIENCETM
Citations

2
checked on Oct 3, 2018

Page view(s)

30
checked on Oct 5, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.