IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v115y2008i1p163-170.html
   My bibliography  Save this article

Overlapping production scheduling planning with multiple objectives--An ant colony approach

Author

Listed:
  • Huang, Rong-Hwa
  • Yang, Chang-Lin

Abstract

No abstract is available for this item.

Suggested Citation

  • Huang, Rong-Hwa & Yang, Chang-Lin, 2008. "Overlapping production scheduling planning with multiple objectives--An ant colony approach," International Journal of Production Economics, Elsevier, vol. 115(1), pages 163-170, September.
    • Handle: RePEc:eee:proeco:v:115:y:2008:i:1:p:163-170
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(08)00154-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ramasesh, Ranga V. & Fu, Haizhen & Fong, Duncan K. H. & Hayya, Jack C., 2000. "Lot streaming in multistage production systems," International Journal of Production Economics, Elsevier, vol. 66(3), pages 199-211, July.
    2. Vickson, R. G., 1995. "Optimal lot streaming for multiple products in a two-machine flow shop," European Journal of Operational Research, Elsevier, vol. 85(3), pages 556-575, September.
    3. Bahroun, Z. & Campagne, J. -P. & Moalla, M., 2000. "The overlapping production planning: A new approach of bounded capacity management," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 21-36, March.
    4. Ben-Daya, M. & Al-Fawzan, M., 1998. "A tabu search approach for the flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 109(1), pages 88-95, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liang, Yun-Chia & Hsiao, Yu-Ming & Tien, Chia-Yun, 2013. "Metaheuristics for drilling operation scheduling in Taiwan PCB industries," International Journal of Production Economics, Elsevier, vol. 141(1), pages 189-198.
    2. Jiae Zhang & Jianjun Yang, 2016. "Flexible job-shop scheduling with flexible workdays, preemption, overlapping in operations and satisfaction criteria: an industrial application," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4894-4918, August.
    3. Liu, Yu & Zhang, Qin & Ouyang, Zhiyuan & Huang, Hong-Zhong, 2021. "Integrated production planning and preventive maintenance scheduling for synchronized parallel machines," Reliability Engineering and System Safety, Elsevier, vol. 215(C).
    4. Jiahui Qian & Zhijing Zhang & Lingling Shi & Dan Song, 2023. "An assembly timing planning method based on knowledge and mixed integer linear programming," Journal of Intelligent Manufacturing, Springer, vol. 34(2), pages 429-453, February.
    5. Lee, Wen-Chiung & Shiau, Yau-Ren & Chen, Shiuan-Kang & Wu, Chin-Chia, 2010. "A two-machine flowshop scheduling problem with deteriorating jobs and blocking," International Journal of Production Economics, Elsevier, vol. 124(1), pages 188-197, March.
    6. Huang, Rong-Hwa, 2010. "Multi-objective job-shop scheduling with lot-splitting production," International Journal of Production Economics, Elsevier, vol. 124(1), pages 206-213, March.

    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.
    1. Chiu, Huan Neng & Chang, Jen Huei, 2005. "Cost models for lot streaming in a multistage flow shop," Omega, Elsevier, vol. 33(5), pages 435-450, October.
    2. D Biskup & M Feldmann, 2006. "Lot streaming with variable sublots: an integer programming formulation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 296-303, March.
    3. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    4. Bozorgirad, Mir Abbas & Logendran, Rasaratnam, 2013. "Bi-criteria group scheduling in hybrid flowshops," International Journal of Production Economics, Elsevier, vol. 145(2), pages 599-612.
    5. Jiae Zhang & Jianjun Yang, 2016. "Flexible job-shop scheduling with flexible workdays, preemption, overlapping in operations and satisfaction criteria: an industrial application," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4894-4918, August.
    6. Jean-Paul Watson & Laura Barbulescu & L. Darrell Whitley & Adele E. Howe, 2002. "Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance," INFORMS Journal on Computing, INFORMS, vol. 14(2), pages 98-123, May.
    7. Van Nieuwenhuyse, Inneke & Vandaele, Nico, 2004. "Determining the optimal number of sublots in a single-product, deterministic flow shop with overlapping operations," International Journal of Production Economics, Elsevier, vol. 92(3), pages 221-239, December.
    8. Chen, Lu & Bostel, Nathalie & Dejax, Pierre & Cai, Jianguo & Xi, Lifeng, 2007. "A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal," European Journal of Operational Research, Elsevier, vol. 181(1), pages 40-58, August.
    9. C. A. Glass & C. N. Potts, 1998. "Structural Properties of Lot Streaming in a Flow Shop," Mathematics of Operations Research, INFORMS, vol. 23(3), pages 624-639, August.
    10. Baptiste, Pierre, 2006. "Stochastic algorithms: Using the worst to reach the best," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 41-51, February.
    11. M Haouari & T Ladhari, 2003. "A branch-and-bound-based local search method for the flow shop problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(10), pages 1076-1084, October.
    12. Yossi Bukchin & Michael Masin & Rinat Kirshner, 2010. "Modeling and analysis of multiobjective lot splitting for N‐product M‐machine flowshop lines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(4), pages 354-366, June.
    13. Gajpal, Yuvraj & Rajendran, Chandrasekharan, 2006. "An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops," International Journal of Production Economics, Elsevier, vol. 101(2), pages 259-272, June.
    14. Ruiz, Ruben & Maroto, Concepcion, 2005. "A comprehensive review and evaluation of permutation flowshop heuristics," European Journal of Operational Research, Elsevier, vol. 165(2), pages 479-494, September.
    15. Pan, Quan-Ke & Ruiz, Rubén, 2012. "An estimation of distribution algorithm for lot-streaming flow shop problems with setup times," Omega, Elsevier, vol. 40(2), pages 166-180, April.
    16. Chung‐Lun Li & Wen‐Qiang Xiao, 2004. "Lot streaming with supplier–manufacturer coordination," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(4), pages 522-542, June.
    17. Varadharajan, T.K. & Rajendran, Chandrasekharan, 2005. "A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs," European Journal of Operational Research, Elsevier, vol. 167(3), pages 772-795, December.
    18. Martín Ravetti & Carlos Riveros & Alexandre Mendes & Mauricio Resende & Panos Pardalos, 2012. "Parallel hybrid heuristics for the permutation flow shop problem," Annals of Operations Research, Springer, vol. 199(1), pages 269-284, October.
    19. Pongcharoen, P. & Hicks, C. & Braiden, P. M., 2004. "The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure," European Journal of Operational Research, Elsevier, vol. 152(1), pages 215-225, January.
    20. Adar A. Kalir & Subhash C. Sarin, 2003. "Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming Problem with Sublot-Attached Setups," Journal of Combinatorial Optimization, Springer, vol. 7(1), pages 23-44, March.

    More about this item

    Statistics

    Access and download statistics

    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:proeco:v:115:y:2008:i:1:p:163-170. 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/ijpe .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.