The complexity of a cyclic scheduling problem with identical machines and precedence constraints
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
- 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.
- S. Thomas McCormick & Michael L. Pinedo & Scott Shenker & Barry Wolf, 1989. "Sequencing in an Assembly Line with Blocking to Minimize Cycle Time," Operations Research, INFORMS, vol. 37(6), pages 925-935, December.
- 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.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Lee, Myungho & Lee, Kangbok & Pinedo, Michael, 2025. "The circular balancing problem," European Journal of Operational Research, Elsevier, vol. 321(1), pages 41-56.
- Osman Kazan & Milind Dawande & Chelliah Sriskandarajah & Kathryn E. Stecke, 2012. "Balancing perfectly periodic service schedules: An application from recycling and waste management," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(2), pages 160-171, March.
- 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.
- 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.
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.- Bolat, Ahmet, 1997. "Sequencing jobs for an automated manufacturing module with buffer," European Journal of Operational Research, Elsevier, vol. 96(3), pages 622-635, February.
- Ahmet Bolat, 1997. "Efficient methods for sequencing minimum job sets on mixed model assembly lines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(5), pages 419-437, August.
- 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.
- 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.
- Peter Brucker & Thomas Kampmeyer, 2008. "Cyclic job shop scheduling problems with blocking," Annals of Operations Research, Springer, vol. 159(1), pages 161-181, March.
- Smith, Kate & Palaniswami, M. & Krishnamoorthy, M., 1996. "Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem," European Journal of Operational Research, Elsevier, vol. 93(2), pages 300-316, September.
- Pempera, Jaroslaw & Smutnicki, Czeslaw, 2018. "Open shop cyclic scheduling," European Journal of Operational Research, Elsevier, vol. 269(2), pages 773-781.
- Herbon, Avi, 2020. "An approximated solution to the constrained integrated manufacturer-buyer supply problem," Operations Research Perspectives, Elsevier, vol. 7(C).
- Toly Chen, 2013. "A Systematic Cycle Time Reduction Procedure for Enhancing the Competitiveness and Sustainability of a Semiconductor Manufacturer," Sustainability, MDPI, vol. 5(11), pages 1-16, November.
- Kats, Vladimir & Lei, Lei & Levner, Eugene, 2008. "Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1196-1211, June.
- Ronconi, Débora P. & Henriques, Luís R.S., 2009. "Some heuristic algorithms for total tardiness minimization in a flowshop with blocking," Omega, Elsevier, vol. 37(2), pages 272-281, April.
- Lin, Shih-Wei & Ying, Kuo-Ching, 2013. "Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm," Omega, Elsevier, vol. 41(2), pages 383-389.
- 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.
- Smutnicki, Czeslaw & Pempera, Jaroslaw & Bocewicz, Grzegorz & Banaszak, Zbigniew, 2022. "Cyclic flow-shop scheduling with no-wait constraints and missing operations," European Journal of Operational Research, Elsevier, vol. 302(1), pages 39-49.
- Levner, Eugene & Kats, Vladimir & Levit, Vadim E., 1997. "An improved algorithm for cyclic flowshop scheduling in a robotic cell," European Journal of Operational Research, Elsevier, vol. 97(3), pages 500-508, March.
- Raaymakers, W. H. M. & Hoogeveen, J. A., 2000. "Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing," European Journal of Operational Research, Elsevier, vol. 126(1), pages 131-151, October.
- J M Framinan & J N D Gupta & R Leisten, 2004. "A review and classification of heuristics for permutation flow-shop scheduling with makespan objective," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1243-1255, December.
- Sawik, Tadeusz, 2004. "Loading and scheduling of a flexible assembly system by mixed integer programming," European Journal of Operational Research, Elsevier, vol. 154(1), pages 1-19, April.
- I.N. Kamal Abadi & Nicholas G. Hall & Chelliah Sriskandarajah, 2000. "Minimizing Cycle Time in a Blocking Flowshop," Operations Research, INFORMS, vol. 48(1), pages 177-180, February.
- 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.
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:91:y:1996:i:3:p:471-480. 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.