Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
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.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Hanen, Claire & Hanzalek, Zdenek, 2020. "Grouping tasks to save energy in a cyclic scheduling problem: A complexity study," European Journal of Operational Research, Elsevier, vol. 284(2), pages 445-459.
- Peter Brucker & Thomas Kampmeyer, 2008. "Cyclic job shop scheduling problems with blocking," Annals of Operations Research, Springer, vol. 159(1), pages 161-181, March.
- Penn, Michal & Raviv, Tal, 2009. "An algorithm for the maximum revenue jobshop problem," European Journal of Operational Research, Elsevier, vol. 193(2), pages 437-450, March.
- Přemysl Šůcha & Zdeněk Hanzálek, 2011. "A cyclic scheduling problem with an undetermined number of parallel identical processors," Computational Optimization and Applications, Springer, vol. 48(1), pages 71-90, January.
- Imai, Akio & Yamakawa, Yukiko & Huang, Kuancheng, 2014. "The strategic berth template problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 77-100.
- Marchetti, Olivier & Munier-Kordon, Alix, 2009. "A sufficient condition for the liveness of weighted event graphs," European Journal of Operational Research, Elsevier, vol. 197(2), pages 532-540, September.
- Idir Hamaz & Laurent Houssin & Sonia Cafieri, 2018. "A robust basic cyclic scheduling problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(3), pages 291-313, September.
- 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.
- Zeng, Daniel D. & Dror, Moshe & Chen, Hsinchun, 2006. "Efficient scheduling of periodic information monitoring requests," European Journal of Operational Research, Elsevier, vol. 173(2), pages 583-599, September.
- Félix Quinton & Idir Hamaz & Laurent Houssin, 2020. "A mixed integer linear programming modelling for the flexible cyclic jobshop problem," Annals of Operations Research, Springer, vol. 285(1), pages 335-352, February.
- Hamaz, Idir & Houssin, Laurent & Cafieri, Sonia, 2024. "The robust cyclic job shop problem," European Journal of Operational Research, Elsevier, vol. 312(3), pages 855-865.
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:72:y:1994:i:1:p:82-101. 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.
We have no bibliographic references for this item. You can help adding them by using 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.