IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v129y2001i2p317-325.html
   My bibliography  Save this article

An extended enterprise planning methodology for the discrete manufacturing industry

Author

Listed:
  • Frederix, Florent

Abstract

No abstract is available for this item.

Suggested Citation

  • Frederix, Florent, 2001. "An extended enterprise planning methodology for the discrete manufacturing industry," European Journal of Operational Research, Elsevier, vol. 129(2), pages 317-325, March.
    • Handle: RePEc:eee:ejores:v:129:y:2001:i:2:p:317-325
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(00)00229-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. Morris A. Cohen & Jehoshua Eliasberg & Teck-Hua Ho, 1996. "New Product Development: The Performance and Time-to-Market Tradeoff," Management Science, INFORMS, vol. 42(2), pages 173-186, February.
    2. 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.
    3. Robert H. Storer & S. David Wu & Renzo Vaccari, 1992. "New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling," Management Science, INFORMS, vol. 38(10), pages 1495-1509, October.
    4. Hau L. Lee & Corey Billington, 1995. "The Evolution of Supply-Chain-Management Models and Practice at Hewlett-Packard," Interfaces, INFORMS, vol. 25(5), pages 42-63, October.
    5. 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.
    6. Beamon, Benita M., 1998. "Supply chain design and analysis:: Models and methods," International Journal of Production Economics, Elsevier, vol. 55(3), pages 281-294, 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. Alfred Degbotse & Brian T. Denton & Kenneth Fordyce & R. John Milne & Robert Orzell & Chi-Tai Wang, 2013. "IBM Blends Heuristics and Optimization to Plan Its Semiconductor Supply Chain," Interfaces, INFORMS, vol. 43(2), pages 130-141, April.
    2. Jacobs, F. Robert & Bendoly, Elliot, 2003. "Enterprise resource planning: Developments and directions for operations management research," European Journal of Operational Research, Elsevier, vol. 146(2), pages 233-240, April.

    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. Bierwirth, C. & Kuhpfahl, J., 2017. "Extended GRASP for the job shop scheduling problem with total weighted tardiness objective," European Journal of Operational Research, Elsevier, vol. 261(3), pages 835-848.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    7. Yabo Luo, 2017. "Nested optimization method combining complex method and ant colony optimization to solve JSSP with complex associated processes," Journal of Intelligent Manufacturing, Springer, vol. 28(8), pages 1801-1815, December.
    8. Murovec, Boštjan, 2015. "Job-shop local-search move evaluation without direct consideration of the criterion’s value," European Journal of Operational Research, Elsevier, vol. 241(2), pages 320-329.
    9. Jewel S. Bonser & S. David Wu, 2001. "Procurement Planning to Maintain Both Short-Term Adaptiveness and Long-Term Perspective," Management Science, INFORMS, vol. 47(6), pages 769-786, June.
    10. Steinhofel, K. & Albrecht, A. & Wong, C. K., 1999. "Two simulated annealing-based heuristics for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 118(3), pages 524-548, November.
    11. Joao António Noivo & Helena Ramalhinho-Lourenço, 1998. "Solving two production scheduling problems with sequence-dependent set-up times," Economics Working Papers 338, Department of Economics and Business, Universitat Pompeu Fabra.
    12. Edzard Weber & Anselm Tiefenbacher & Norbert Gronau, 2019. "Need for Standardization and Systematization of Test Data for Job-Shop Scheduling," Data, MDPI, vol. 4(1), pages 1-21, February.
    13. Selcuk Goren & Ihsan Sabuncuoglu & Utku Koc, 2012. "Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(1), pages 26-38, February.
    14. T. C. E. Cheng & Bo Peng & Zhipeng Lü, 2016. "A hybrid evolutionary algorithm to solve the job shop scheduling problem," Annals of Operations Research, Springer, vol. 242(2), pages 223-237, July.
    15. Mattfeld, Dirk C. & Bierwirth, Christian, 2004. "An efficient genetic algorithm for job shop scheduling with tardiness objectives," European Journal of Operational Research, Elsevier, vol. 155(3), pages 616-630, June.
    16. Diarmuid Grimes & Emmanuel Hebrard, 2015. "Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 268-284, May.
    17. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    18. Yuanfei Wei & Zalinda Othman & Kauthar Mohd Daud & Shihong Yin & Qifang Luo & Yongquan Zhou, 2022. "Equilibrium Optimizer and Slime Mould Algorithm with Variable Neighborhood Search for Job Shop Scheduling Problem," Mathematics, MDPI, vol. 10(21), pages 1-20, November.
    19. G I Zobolas & C D Tarantilis & G Ioannou, 2009. "A hybrid evolutionary algorithm for the job shop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 221-235, February.
    20. Kedar S. Naphade & S. David Wu & Robert H. Storer & Bhavin J. Doshi, 2001. "Melt Scheduling to Trade Off Material Waste and Shipping Performance," Operations Research, INFORMS, vol. 49(5), pages 629-645, October.

    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:ejores:v:129:y:2001:i:2:p:317-325. 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.

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