An algorithm for the maximum revenue jobshop problem
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- 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.
- Hanen, Claire, 1994. "Study of a NP-hard cyclic scheduling problem: The recurrent job-shop," European Journal of Operational Research, Elsevier, vol. 72(1), pages 82-101, January.
- J. G. Dai & Gideon Weiss, 2002. "A Fluid Heuristic for Minimizing Makespan in Job Shops," Operations Research, INFORMS, vol. 50(4), pages 692-707, August.
- 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.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Manzhan Gu & Xiwen Lu & Jinwei Gu, 2017. "An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 473-495, February.
- Jinwei Gu & Manzhan Gu & Xiwen Lu & Ying Zhang, 2018. "Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 142-161, July.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Munier, A., 1996. "The complexity of a cyclic scheduling problem with identical machines and precedence constraints," European Journal of Operational Research, Elsevier, vol. 91(3), pages 471-480, June.
- Tarantilis, C. D. & Kiranoudis, C. T., 2002. "A list-based threshold accepting method for job shop scheduling problems," International Journal of Production Economics, Elsevier, vol. 77(2), pages 159-171, May.
- Susana Fernandes & Helena Ramalhinho-Lourenço, 2007. "A simple optimised search heuristic for the job-shop scheduling problem," Economics Working Papers 1050, Department of Economics and Business, Universitat Pompeu Fabra.
- Bagchi, Tapan P. & Gupta, Jatinder N.D. & Sriskandarajah, Chelliah, 2006. "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 169(3), pages 816-854, March.
- Lisa Fleischer & Jay Sethuraman, 2005. "Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 916-938, November.
- Wenda Zhang & Jason J. Sauppe & Sheldon H. Jacobson, 2021. "An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1091-1102, July.
- Raja Awais Liaqait & Shermeen Hamid & Salman Sagheer Warsi & Azfar Khalid, 2021. "A Critical Analysis of Job Shop Scheduling in Context of Industry 4.0," Sustainability, MDPI, vol. 13(14), pages 1-19, July.
- Quadt, Daniel & Kuhn, Heinrich, 2007. "A taxonomy of flexible flow line scheduling procedures," European Journal of Operational Research, Elsevier, vol. 178(3), pages 686-698, May.
- Mogali, Jayanth Krishna & Barbulescu, Laura & Smith, Stephen F., 2021. "Efficient primal heuristic updates for the blocking job shop problem," European Journal of Operational Research, Elsevier, vol. 295(1), pages 82-101.
- Sels, Veronique & Craeymeersch, Kjeld & Vanhoucke, Mario, 2011.
"A hybrid single and dual population search procedure for the job shop scheduling problem,"
European Journal of Operational Research, Elsevier, vol. 215(3), pages 512-523, December.
- V. Sels & K. Craeymeersch & M. Vanhoucke, 2010. "A hybrid single and dual population search procedure for the job shop scheduling problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 10/679, Ghent University, Faculty of Economics and Business Administration.
- Zijm, W. H. M. & Buitenhek, R., 1996. "Capacity planning and lead time management," International Journal of Production Economics, Elsevier, vol. 46(1), pages 165-179, December.
- Pongcharoen, P. & Hicks, C. & Braiden, P. M. & Stewardson, D. J., 2002. "Determining optimum Genetic Algorithm parameters for scheduling the manufacturing and assembly of complex products," International Journal of Production Economics, Elsevier, vol. 78(3), pages 311-322, August.
- Lochtefeld, Darrell F. & Ciarallo, Frank W., 2015. "Multi-objectivization Via Decomposition: An analysis of helper-objectives and complete decomposition," European Journal of Operational Research, Elsevier, vol. 243(2), pages 395-404.
- Golenko-Ginzburg, Dimitri & Kesler, Shmuel & Landsman, Zinoviy, 1995. "Industrial job-shop scheduling with random operations and different priorities," International Journal of Production Economics, Elsevier, vol. 40(2-3), pages 185-195, August.
- S. David Wu & Eui-Seok Byeon & Robert H. Storer, 1999. "A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness," Operations Research, INFORMS, vol. 47(1), pages 113-124, February.
- Ganesan, Viswanath Kumar & Sivakumar, Appa Iyer, 2006. "Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times," International Journal of Production Economics, Elsevier, vol. 103(2), pages 633-647, October.
- Meloni, Carlo & Pranzo, Marco & Samà, Marcella, 2022. "Evaluation of VaR and CVaR for the makespan in interval valued blocking job shops," International Journal of Production Economics, Elsevier, vol. 247(C).
- Buscher, Udo & Shen, Liji, 2009. "An integrated tabu search algorithm for the lot streaming problem in job shops," European Journal of Operational Research, Elsevier, vol. 199(2), pages 385-399, December.
- Sourd, Francis, 2005. "Optimal timing of a sequence of tasks with general completion costs," European Journal of Operational Research, Elsevier, vol. 165(1), pages 82-96, August.
- Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.