The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints
Author
Abstract
Suggested Citation
DOI: 10.1287/mnsc.37.12.1629
Download full text from publisher
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- SubaI, Corinne & Baptiste, Pierre & Niel, Eric, 2006. "Scheduling issues for environmentally responsible manufacturing: The case of hoist scheduling in an electroplating line," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 74-87, February.
- Selcuk Karabati & Panagiotis Kouvelis, 1996. "Cyclic scheduling in flow lines: Modeling observations, effective heuristics and a cycle time minimization procedure," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(2), pages 211-231, March.
- Crama, Yves, 1997. "Combinatorial optimization models for production scheduling in automated manufacturing systems," European Journal of Operational Research, Elsevier, vol. 99(1), pages 136-153, May.
- Paul, Henrik J. & Bierwirth, Christian & Kopfer, Herbert, 2007. "A heuristic scheduling procedure for multi-item hoist production lines," International Journal of Production Economics, Elsevier, vol. 105(1), pages 54-69, January.
- Jiyin Liu & Yun Jiang, 2005. "An Efficient Optimal Solution to the Two-Hoist No-Wait Cyclic Scheduling Problem," Operations Research, INFORMS, vol. 53(2), pages 313-327, April.
- Zhili Zhou & Ling Li, 2009. "A solution for cyclic scheduling of multi-hoists without overlapping," Annals of Operations Research, Springer, vol. 168(1), pages 5-21, April.
- Sheen, Gwo-Ji & Liao, Lu-Wen, 2007. "A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags," European Journal of Operational Research, Elsevier, vol. 181(1), pages 102-116, August.
- Janny M. Y. Leung & Guoqing Zhang & Xiaoguang Yang & Raymond Mak & Kokin Lam, 2004. "Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach," Operations Research, INFORMS, vol. 52(6), pages 965-976, December.
- Y N Sotskov & A Allahverdi & T-C Lai, 2004. "Flowshop scheduling problem to minimize total completion time with random and bounded processing times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(3), pages 277-286, March.
More about this item
Keywords
cyclic scheduling; heuristic algorithms; hoists; time window constraints; problem partitioning;All these keywords.
Statistics
Access and download statisticsCorrections
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:inm:ormnsc:v:37:y:1991:i:12:p:1629-1639. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.