IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v46-47y1996i1p165-179.html
   My bibliography  Save this article

Capacity planning and lead time management

Author

Listed:
  • Zijm, W. H. M.
  • Buitenhek, R.

Abstract

No abstract is available for this item.

Suggested Citation

  • Zijm, W. H. M. & Buitenhek, R., 1996. "Capacity planning and lead time management," International Journal of Production Economics, Elsevier, vol. 46(1), pages 165-179, December.
    • Handle: RePEc:eee:proeco:v:46-47:y:1996:i:1:p:165-179
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0925-5273(95)00161-1
    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. Uday S. Karmarkar, 1987. "Lot Sizes, Lead Times and In-Process Inventories," Management Science, INFORMS, vol. 33(3), pages 409-418, March.
    2. Carlier, Jacques, 1982. "The one-machine sequencing problem," European Journal of Operational Research, Elsevier, vol. 11(1), pages 42-47, September.
    3. Egon Balas & Jan Karel Lenstra & Alkis Vazacopoulos, 1995. "The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling," Management Science, INFORMS, vol. 41(1), pages 94-109, January.
    4. 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.
    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. Marc R. Lambrecht & Philip L. Ivens & Nico J. Vandaele, 1998. "ACLIPS: A Capacity and Lead Time Integrated Procedure for Scheduling," Management Science, INFORMS, vol. 44(11-Part-1), pages 1548-1561, November.
    2. Jalali, Hamed & Carmen, Raïsa & Van Nieuwenhuyse, Inneke & Boute, Robert, 2019. "Quality and pricing decisions in production/inventory systems," European Journal of Operational Research, Elsevier, vol. 272(1), pages 195-206.
    3. Kim, Bokang & Kim, Sooyoung, 2001. "Extended model for a hybrid production planning approach," International Journal of Production Economics, Elsevier, vol. 73(2), pages 165-173, September.
    4. Selcuk, B. & Fransoo, J.C. & De Kok, A.G., 2006. "The effect of updating lead times on the performance of hierarchical planning systems," International Journal of Production Economics, Elsevier, vol. 104(2), pages 427-440, December.
    5. Morikawa, Katsumi & Takahashi, Katsuhiko & Hirotani, Daisuke, 2014. "Make-to-stock policies for a multistage serial system under a make-to-order production environment," International Journal of Production Economics, Elsevier, vol. 147(PA), pages 30-37.
    6. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    7. Julia Pahl & Stefan Voß & David Woodruff, 2007. "Production planning with load dependent lead times: an update of research," Annals of Operations Research, Springer, vol. 153(1), pages 297-345, September.

    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. Egon Balas & Giuseppe Lancia & Paolo Serafini & Alkiviadis Vazacopoulos, 1998. "Job Shop Scheduling With Deadlines," Journal of Combinatorial Optimization, Springer, vol. 1(4), pages 329-353, December.
    2. Mukherjee, Saral & Chatterjee Ashis K, 2002. "Applying Machine Based Decomposition in 2-Machine Flow Shops," IIMA Working Papers WP2002-08-05, Indian Institute of Management Ahmedabad, Research and Publication Department.
    3. 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.
    4. 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.
    5. Da Col, Giacomo & Teppan, Erich C., 2022. "Industrial-size job shop scheduling with constraint programming," Operations Research Perspectives, Elsevier, vol. 9(C).
    6. Egon Balas & Alkis Vazacopoulos, 1998. "Guided Local Search with Shifting Bottleneck for Job Shop Scheduling," Management Science, INFORMS, vol. 44(2), pages 262-275, February.
    7. Braune, R. & Zäpfel, G. & Affenzeller, M., 2012. "An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective," European Journal of Operational Research, Elsevier, vol. 218(1), pages 76-85.
    8. Marc R. Lambrecht & Philip L. Ivens & Nico J. Vandaele, 1998. "ACLIPS: A Capacity and Lead Time Integrated Procedure for Scheduling," Management Science, INFORMS, vol. 44(11-Part-1), pages 1548-1561, November.
    9. Mukherjee, Saral & Chatterjee, A.K., 2007. "On the representation of the one machine sequencing problem in the shifting bottleneck heuristic," European Journal of Operational Research, Elsevier, vol. 182(1), pages 475-479, October.
    10. Mukherjee, Saral & Chatterjee, A.K., 2006. "Applying machine based decomposition in 2-machine flow shops," European Journal of Operational Research, Elsevier, vol. 169(3), pages 723-741, March.
    11. Wenda Zhang & Jason J. Sauppe & Sheldon H. Jacobson, 2021. "An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1091-1102, July.
    12. 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.
    13. Ansis Ozolins, 2020. "Bounded dynamic programming algorithm for the job shop problem with sequence dependent setup times," Operational Research, Springer, vol. 20(3), pages 1701-1728, September.
    14. Zoghby, Jeriad & Wesley Barnes, J. & Hasenbein, John J., 2005. "Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches," European Journal of Operational Research, Elsevier, vol. 167(2), pages 336-348, December.
    15. Guinet, Alain & Legrand, Marie, 1998. "Reduction of job-shop problems to flow-shop problems with precedence constraints," European Journal of Operational Research, Elsevier, vol. 109(1), pages 96-110, August.
    16. Raúl Mencía & Carlos Mencía, 2021. "One-Machine Scheduling with Time-Dependent Capacity via Efficient Memetic Algorithms," Mathematics, MDPI, vol. 9(23), pages 1-24, November.
    17. Michael Pinedo & Marcos Singer, 1999. "A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(1), pages 1-17, February.
    18. El-Bouri, A. & Azizi, N. & Zolfaghari, S., 2007. "A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1894-1910, March.
    19. Chung, Daeyoung & Lee, Kichang & Shin, Kitae & Park, Jinwoo, 2005. "A new approach to job shop scheduling problems with due date constraints considering operation subcontracts," International Journal of Production Economics, Elsevier, vol. 98(2), pages 238-250, November.
    20. Verena Schmid & Karl F. Doerner, 2014. "Examination and Operating Room Scheduling Including Optimization of Intrahospital Routing," Transportation Science, INFORMS, vol. 48(1), pages 59-77, February.

    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:46-47:y:1996:i:1:p:165-179. 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.