An algorithm for the maximum revenue jobshop problem
In this paper, we state and study the problem of selecting a product mix and a dispatching rule for a jobshop system to maximize its revenue rate over an infinite planning horizon. We solve the problem of obtaining maximum revenue by selecting a product mix and determine a schedule. The designed algorithm appropriately rounds an optimal solution to a fluid relaxation in which we replace discrete jobs with the flow of a continuous fluid. The algorithm solves the fluid relaxation optimally and then aims to keep the discrete schedule close to the continuous one obtained by the fluid solution. The schedule obtained is cyclic, with bounded WIP and asymptotically optimal. A secondary aim is to further reduce the WIP and the buffers' sizes by shortening the cycle length. This is achieved at the cost of a slight compromise on the revenue. We report on satisfactory computational results on some benchmark instances.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Kamoun, H. & Sriskandarajah, C., 1993. "The complexity of scheduling jobs in repetitive manufacturing systems," European Journal of Operational Research, Elsevier, vol. 70(3), pages 350-364, November.
- Joseph Adams & Egon Balas & Daniel Zawack, 1988. "The Shifting Bottleneck Procedure for Job Shop Scheduling," Management Science, INFORMS, vol. 34(3), pages 391-401, March.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:193:y:2009:i:2:p:437-450. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.