This paper reconsiders the formulation of the operation-allocation problem to include aspects of refixturing and limited tool availability. A comparatively simple integer programming formulation is proposed which avoids the non-linearities of a previous approach. Computational aspects of the problem are discussed and the formulation is shown to give successful results on test problems.
International Journal of Production Research
Volume 27, 1989 - Issue 8
![Sample our Economics, Finance,Business & Industry journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5931/TOC-Subject-Sample-2021-Economics-Finance-Business-Industry.jpg"})
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related Research Data
Dynamic scheduling of manufacturing systems using machine learning: An updated review
Source:
Cambridge University Press (CUP)
Linking provided by
