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

Deterministic job-shop scheduling: Past, present and future

Author

Listed:
  • Jain, A. S.
  • Meeran, S.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:113:y:1999:i:2:p:390-434
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(98)00113-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. E. DYER, Martin & WOLSEY, Laurence A., 1990. "Formulating the single machine sequencing problem with release dates as a mixed integer program," LIDAM Reprints CORE 917, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Sotskov, Yu. N., 1991. "The complexity of shop-scheduling problems with two or three jobs," European Journal of Operational Research, Elsevier, vol. 53(3), pages 326-336, August.
    3. Éric D. Taillard, 1994. "Parallel Taboo Search Techniques for the Job Shop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 6(2), pages 108-117, May.
    4. Jeffrey R. Barker & Graham B. McMahon, 1985. "Scheduling the General Job-Shop," Management Science, INFORMS, vol. 31(5), pages 594-598, May.
    5. 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.
    6. 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.
    7. 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.
    8. Robert H. Storer & S. David Wu & Renzo Vaccari, 1995. "Problem and Heuristic Space Search Strategies for Job Shop Scheduling," INFORMS Journal on Computing, INFORMS, vol. 7(4), pages 453-467, November.
    9. John M. Charlton & Carl C. Death, 1970. "A Method of Solution for General Machine-Scheduling Problems," Operations Research, INFORMS, vol. 18(4), pages 689-707, August.
    10. William S. Gere, Jr., 1966. "Heuristics in Job Shop Scheduling," Management Science, INFORMS, vol. 13(3), pages 167-190, November.
    11. 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.
    12. S. S. Panwalkar & Wafik Iskander, 1977. "A Survey of Scheduling Rules," Operations Research, INFORMS, vol. 25(1), pages 45-61, February.
    13. Satake, Tsuyoshi & Morikawa, Katsumi & Nakamura, Nobuto, 1994. "Neural network approach for minimizing the makespan of the general job-shop," International Journal of Production Economics, Elsevier, vol. 33(1-3), pages 67-74, January.
    14. D. P. Williamson & L. A. Hall & J. A. Hoogeveen & C. A. J. Hurkens & J. K. Lenstra & S. V. Sevast'janov & D. B. Shmoys, 1997. "Short Shop Schedules," Operations Research, INFORMS, vol. 45(2), pages 288-294, April.
    15. Egon Balas, 1965. "An Additive Algorithm for Solving Linear Programs with Zero-One Variables," Operations Research, INFORMS, vol. 13(4), pages 517-546, August.
    16. Linus Schrage, 1970. "Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case," Operations Research, INFORMS, vol. 18(2), pages 263-278, April.
    17. 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.
    18. Harold H. Greenberg, 1968. "A Branch-Bound Solution to the General Scheduling Problem," Operations Research, INFORMS, vol. 16(2), pages 353-361, April.
    19. Marshall L. Fisher, 1973. "Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I," Operations Research, INFORMS, vol. 21(5), pages 1114-1127, October.
    20. J. Carlier & E. Pinson, 1989. "An Algorithm for Solving the Job-Shop Problem," Management Science, INFORMS, vol. 35(2), pages 164-176, February.
    21. Taillard, E., 1993. "Benchmarks for basic scheduling problems," European Journal of Operational Research, Elsevier, vol. 64(2), pages 278-285, January.
    22. 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.
    23. Carlier, Jacques, 1982. "The one-machine sequencing problem," European Journal of Operational Research, Elsevier, vol. 11(1), pages 42-47, September.
    24. DYER, Martin E. & WOLSEY, Laurence A., 1990. "Formulating the single machine sequencing problem with release dates as a mixed integer program," LIDAM Reprints CORE 878, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    25. Włodzimierz Szwarc, 1960. "Solution of the Akers-Friedman Scheduling Problem," Operations Research, INFORMS, vol. 8(6), pages 782-788, December.
    26. Lourenco, Helena Ramalhinho, 1995. "Job-shop scheduling: Computational study of local search and large-step optimization methods," European Journal of Operational Research, Elsevier, vol. 83(2), pages 347-364, June.
    27. Dagli, C. H. & Sittisathanchai, S., 1995. "Genetic neuro-scheduler: A new approach for job shop scheduling," International Journal of Production Economics, Elsevier, vol. 41(1-3), pages 135-145, October.
    28. Ramudhin, Amar & Marier, Philippe, 1996. "The generalized Shifting Bottleneck Procedure," European Journal of Operational Research, Elsevier, vol. 93(1), pages 34-48, August.
    29. Erwin Pesch & Ulrich A. W. Tetzlaff, 1996. "Constraint Propagation Based Scheduling of Job Shops," INFORMS Journal on Computing, INFORMS, vol. 8(2), pages 144-157, May.
    30. Marshall L. Fisher & Alexander H. G. Rinnooy Kan, 1988. "The Design, Analysis and Implementation of Heuristics," Management Science, INFORMS, vol. 34(3), pages 263-265, March.
    31. William W. Hardgrave & George L. Nemhauser, 1963. "A Geometric Model and a Graphical Algorithm for a Sequencing Problem," Operations Research, INFORMS, vol. 11(6), pages 889-900, December.
    32. 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.
    33. Glover, Fred & Greenberg, Harvey J., 1989. "New approaches for heuristic search: A bilateral linkage with artificial intelligence," European Journal of Operational Research, Elsevier, vol. 39(2), pages 119-130, March.
    34. 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.
    35. Eugeniusz Nowicki & Czeslaw Smutnicki, 1996. "A Fast Taboo Search Algorithm for the Job Shop Problem," Management Science, INFORMS, vol. 42(6), pages 797-813, June.
    36. 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.
    37. Edward H. Bowman, 1959. "The Schedule-Sequencing Problem," Operations Research, INFORMS, vol. 7(5), pages 621-624, October.
    38. Nuijten, W. P. M. & Aarts, E. H. L., 1996. "A computational study of constraint satisfaction for multiple capacitated job shop scheduling," European Journal of Operational Research, Elsevier, vol. 90(2), pages 269-284, April.
    39. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    40. E. H. L. Aarts & P. J. M. van Laarhoven & J. K. Lenstra & N. L. J. Ulder, 1994. "A Computational Study of Local Search Algorithms for Job Shop Scheduling," INFORMS Journal on Computing, INFORMS, vol. 6(2), pages 118-125, May.
    41. R. J. M. Vaessens & E. H. L. Aarts & J. K. Lenstra, 1996. "Job Shop Scheduling by Local Search," INFORMS Journal on Computing, INFORMS, vol. 8(3), pages 302-317, August.
    42. Carlier, J. & Pinson, E., 1994. "Adjustment of heads and tails for the job-shop problem," European Journal of Operational Research, Elsevier, vol. 78(2), pages 146-161, October.
    43. Kubiak, Wieslaw & Timkovsky, Vadim, 1996. "Total completion time minimization in two-machine job shops with unit-time operations," European Journal of Operational Research, Elsevier, vol. 94(2), pages 310-320, October.
    44. Fred Glover, 1975. "Surrogate Constraint Duality in Mathematical Programming," Operations Research, INFORMS, vol. 23(3), pages 434-451, June.
    45. Kusiak, Andrew & Chen, Mingyuan, 1988. "Expert systems for planning and scheduling manufacturing systems," European Journal of Operational Research, Elsevier, vol. 34(2), pages 113-130, March.
    46. J. Erschler & F. Roubellat & J. P. Vernhes, 1976. "Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem," Operations Research, INFORMS, vol. 24(4), pages 774-783, August.
    47. Cheng-Chung Cheng & Stephen Smith, 1997. "Applying constraint satisfaction techniques to job shop scheduling," Annals of Operations Research, Springer, vol. 70(0), pages 327-357, April.
    48. M. Florian & P. Trepant & G. McMahon, 1971. "An Implicit Enumeration Algorithm for the Machine Sequencing Problem," Management Science, INFORMS, vol. 17(12), pages 782-792, August.
    49. Blazewicz, Jacek & Dror, Moshe & Weglarz, Jan, 1991. "Mathematical programming formulations for machine scheduling: A survey," European Journal of Operational Research, Elsevier, vol. 51(3), pages 283-300, April.
    50. Sheldon B. Akers, 1956. "Letter to the Editor---A Graphical Approach to Production Scheduling Problems," Operations Research, INFORMS, vol. 4(2), pages 244-245, April.
    51. Teofilo Gonzalez & Sartaj Sahni, 1978. "Flowshop and Jobshop Schedules: Complexity and Approximation," Operations Research, INFORMS, vol. 26(1), pages 36-52, February.
    52. 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.
    Full references (including those not matched with items on IDEAS)

    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. Da Col, Giacomo & Teppan, Erich C., 2022. "Industrial-size job shop scheduling with constraint programming," Operations Research Perspectives, Elsevier, vol. 9(C).
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. F. Guerriero, 2008. "Hybrid Rollout Approaches for the Job Shop Scheduling Problem," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 419-438, November.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. 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.

    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:113:y:1999:i:2:p:390-434. 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.