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

Extending the shifting bottleneck procedure to real-life applications

Author

Listed:
  • Ivens, Philip
  • Lambrecht, Marc

Abstract

No abstract is available for this item.

Suggested Citation

  • Ivens, Philip & Lambrecht, Marc, 1996. "Extending the shifting bottleneck procedure to real-life applications," European Journal of Operational Research, Elsevier, vol. 90(2), pages 252-268, April.
    • Handle: RePEc:eee:ejores:v:90:y:1996:i:2:p:252-268
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(95)00353-3
    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. Jeffrey R. Barker & Graham B. McMahon, 1985. "Scheduling the General Job-Shop," Management Science, INFORMS, vol. 31(5), pages 594-598, May.
    2. David Applegate & William Cook, 1991. "A Computational Study of the Job-Shop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 3(2), pages 149-156, May.
    3. Carlier, Jacques, 1982. "The one-machine sequencing problem," European Journal of Operational Research, Elsevier, vol. 11(1), pages 42-47, September.
    4. Carlier, Jacques, 1987. "Scheduling jobs with release dates and tails on identical machines to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 29(3), pages 298-306, June.
    5. B. J. Lageweg & J. K. Lenstra & A. H. G. Rinnooy Kan, 1977. "Job-Shop Scheduling by Implicit Enumeration," Management Science, INFORMS, vol. 24(4), pages 441-450, December.
    6. Graham McMahon & Michael Florian, 1975. "On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness," Operations Research, INFORMS, vol. 23(3), pages 475-482, June.
    7. Grabowski, J. & Nowicki, E. & Zdrzalka, S., 1986. "A block approach for single-machine scheduling with release dates and due dates," European Journal of Operational Research, Elsevier, vol. 26(2), pages 278-285, August.
    8. 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. 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.
    2. Rossi, Andrea, 2014. "Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships," International Journal of Production Economics, Elsevier, vol. 153(C), pages 253-267.
    3. Luscombe, Ruth & Kozan, Erhan, 2016. "Dynamic resource allocation to improve emergency department efficiency in real time," European Journal of Operational Research, Elsevier, vol. 255(2), pages 593-603.
    4. P Corry & E Kozan, 2004. "Job scheduling with technical constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 160-169, February.
    5. Xiong, Hegen & Fan, Huali & Jiang, Guozhang & Li, Gongfa, 2017. "A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints," European Journal of Operational Research, Elsevier, vol. 257(1), pages 13-24.
    6. 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.
    7. Hosseini, Amir & Otto, Alena & Pesch, Erwin, 2024. "Scheduling in manufacturing with transportation: Classification and solution techniques," European Journal of Operational Research, Elsevier, vol. 315(3), pages 821-843.
    8. Alvarez-Valdes, R. & Fuertes, A. & Tamarit, J. M. & Gimenez, G. & Ramos, R., 2005. "A heuristic to schedule flexible job-shop in a glass factory," European Journal of Operational Research, Elsevier, vol. 165(2), pages 525-534, September.
    9. Gregory A. Kasapidis & Stéphane Dauzère‐Pérès & Dimitris C. Paraskevopoulos & Panagiotis P. Repoussis & Christos D. Tarantilis, 2023. "On the multiresource flexible job‐shop scheduling problem with arbitrary precedence graphs," Production and Operations Management, Production and Operations Management Society, vol. 32(7), pages 2322-2330, July.
    10. 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.
    11. Rego, César & Duarte, Renato, 2009. "A filter-and-fan approach to the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 650-662, May.
    12. Dauzère-Pérès, Stéphane & Ding, Junwen & Shen, Liji & Tamssaouet, Karim, 2024. "The flexible job shop scheduling problem: A review," European Journal of Operational Research, Elsevier, vol. 314(2), pages 409-432.

    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. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    2. 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.
    3. Pan, Yunpeng & Shi, Leyuan, 2006. "Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem," European Journal of Operational Research, Elsevier, vol. 168(3), pages 1030-1039, February.
    4. 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.
    5. Da Col, Giacomo & Teppan, Erich C., 2022. "Industrial-size job shop scheduling with constraint programming," Operations Research Perspectives, Elsevier, vol. 9(C).
    6. Pezzella, Ferdinando & Merelli, Emanuela, 2000. "A tabu search method guided by shifting bottleneck for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 120(2), pages 297-310, January.
    7. 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.
    8. Golenko-Ginzburg, Dimitri & Kesler, Shmuel & Landsman, Zinoviy, 1995. "Industrial job-shop scheduling with random operations and different priorities," International Journal of Production Economics, Elsevier, vol. 40(2-3), pages 185-195, August.
    9. 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.
    10. Francis Sourd & Wim Nuijten, 2000. "Multiple-Machine Lower Bounds for Shop-Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 341-352, November.
    11. Hosseini, Amir & Otto, Alena & Pesch, Erwin, 2024. "Scheduling in manufacturing with transportation: Classification and solution techniques," European Journal of Operational Research, Elsevier, vol. 315(3), pages 821-843.
    12. 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.
    13. Dauzere-Peres, Stephane, 1995. "A procedure for the one-machine sequencing problem with dependent jobs," European Journal of Operational Research, Elsevier, vol. 81(3), pages 579-589, March.
    14. Lancia, Giuseppe, 2000. "Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 120(2), pages 277-288, January.
    15. 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.
    16. 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.
    17. 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.
    18. Chatterjee A K & Mukherjee, Saral, 2006. "Unified Concept of Bottleneck," IIMA Working Papers WP2006-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    19. Federico Alonso-Pecina & José Alberto Hernández & José Maria Sigarreta & Nodari Vakhania, 2020. "Fast Approximation for Scheduling One Machine," Mathematics, MDPI, vol. 8(9), pages 1-18, September.
    20. Mascis, Alessandro & Pacciarelli, Dario, 2002. "Job-shop scheduling with blocking and no-wait constraints," European Journal of Operational Research, Elsevier, vol. 143(3), pages 498-517, December.

    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:90:y:1996:i:2:p:252-268. 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.