IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v24y1977i4p441-450.html
   My bibliography  Save this article

Job-Shop Scheduling by Implicit Enumeration

Author

Listed:
  • B. J. Lageweg

    (Mathematisch Centrum, Amsterdam)

  • J. K. Lenstra

    (Mathematisch Centrum, Amsterdam)

  • A. H. G. Rinnooy Kan

    (Graduate School of Management, Delft)

Abstract

The classical combinatorial optimization problem of minimizing maximum completion time in a general job-shop has been the subject of extensive research. In this paper we review and extend this work. A general bounding approach is developed which includes all previously presented lower bounds as special cases. The strongest bound obtainable in this way is combined with two enumeration schemes, the relative merits of which are discussed. The results of some computational experiments and a large bibliography are included as well.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:ormnsc:v:24:y:1977:i:4:p:441-450
    DOI: 10.1287/mnsc.24.4.441
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.24.4.441
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.24.4.441?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. Sabuncuoglu, Ihsan & Gurgun, Burckaan, 1996. "A neural network model for scheduling problems," European Journal of Operational Research, Elsevier, vol. 93(2), pages 288-299, September.
    2. Gromicho, J.A.S. & Hoorn, J.J. van & Timmer, G.T., 2009. "Exponentially better than brute force: solving the jobshop scheduling problem optimally by dynamic programming," Serie Research Memoranda 0056, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    3. Goncalves, Jose Fernando & de Magalhaes Mendes, Jorge Jose & Resende, Mauricio G. C., 2005. "A hybrid genetic algorithm for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 167(1), pages 77-95, November.
    4. Hamed Piroozfard & Kuan Yew Wong & Adnan Hassan, 2016. "A Hybrid Genetic Algorithm with a Knowledge-Based Operator for Solving the Job Shop Scheduling Problems," Journal of Optimization, Hindawi, vol. 2016, pages 1-13, April.
    5. 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.
    6. 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.
    7. Valls, Vicente & Angeles Perez, M. & Sacramento Quintanilla, M., 1998. "A tabu search approach to machine scheduling," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 277-300, April.
    8. Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.
    9. Lang, N.A. & Moonen, J.M. & Srour, F.J. & Zuidwijk, R.A., 2008. "Multi Agent Systems in Logistics: A Literature and State-of-the-art Review," ERIM Report Series Research in Management ERS-2008-043-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    10. 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.
    11. 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.
    12. Ouenniche, J. & Bertrand, J. W. M., 2001. "The finite horizon economic lot sizing problem in job shops: : the multiple cycle approach," International Journal of Production Economics, Elsevier, vol. 74(1-3), pages 49-61, December.
    13. 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.
    14. 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.
    15. 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.
    16. Pannee Suanpang & Pitchaya Jamjuntr & Kittisak Jermsittiparsert & Phuripoj Kaewyong, 2022. "Tourism Service Scheduling in Smart City Based on Hybrid Genetic Algorithm Simulated Annealing Algorithm," Sustainability, MDPI, vol. 14(23), pages 1-21, December.
    17. Giuseppe Lancia & Franca Rinaldi & Paolo Serafini, 2011. "A time-indexed LP-based approach for min-sum job-shop problems," Annals of Operations Research, Springer, vol. 186(1), pages 175-198, June.
    18. 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.

    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:inm:ormnsc:v:24:y:1977:i:4:p:441-450. 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.

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