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

An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling

Author

Listed:
  • He, Zesheng
  • Yang, Taeyong
  • Tiger, Andy

Abstract

No abstract is available for this item.

Suggested Citation

  • He, Zesheng & Yang, Taeyong & Tiger, Andy, 1996. "An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling," European Journal of Operational Research, Elsevier, vol. 91(1), pages 99-117, May.
    • Handle: RePEc:eee:ejores:v:91:y:1996:i:1:p:99-117
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00361-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. Ari P. J. Vepsalainen & Thomas E. Morton, 1987. "Priority Rules for Job Shops with Weighted Tardiness Costs," Management Science, INFORMS, vol. 33(8), pages 1035-1047, August.
    2. James K. Weeks, 1979. "A Simulation Study of Predictable Due-Dates," Management Science, INFORMS, vol. 25(4), pages 363-373, April.
    3. John Dumond & Vincent A. Mabert, 1988. "Evaluating Project Scheduling and Due Date Assignment Procedures: An Experimental Analysis," Management Science, INFORMS, vol. 34(1), pages 101-118, January.
    4. David S. Johnson & Cecilia R. Aragon & Lyle A. McGeoch & Catherine Schevon, 1989. "Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning," Operations Research, INFORMS, vol. 37(6), pages 865-892, December.
    5. Teofilo Gonzalez & Sartaj Sahni, 1978. "Flowshop and Jobshop Schedules: Complexity and Approximation," Operations Research, INFORMS, vol. 26(1), pages 36-52, February.
    6. Eglese, R. W., 1990. "Simulated annealing: A tool for operational research," European Journal of Operational Research, Elsevier, vol. 46(3), pages 271-281, June.
    7. Osman, IH & Potts, CN, 1989. "Simulated annealing for permutation flow-shop scheduling," Omega, Elsevier, vol. 17(6), pages 551-557.
    8. J. W. M. Bertrand, 1983. "The Effect of Workload Dependent Due-Dates on Job Shop Performance," Management Science, INFORMS, vol. 29(7), pages 799-816, July.
    9. Jeffcoat, David E. & Bulfin, Robert L., 1993. "Simulated annealing for resource-constrained scheduling," European Journal of Operational Research, Elsevier, vol. 70(1), pages 43-51, October.
    10. M. R. Garey & D. S. Johnson & Ravi Sethi, 1976. "The Complexity of Flowshop and Jobshop Scheduling," Mathematics of Operations Research, INFORMS, vol. 1(2), pages 117-129, May.
    11. Kenneth R. Baker, 1984. "Sequencing Rules and Due-Date Assignments in a Job Shop," Management Science, INFORMS, vol. 30(9), pages 1093-1104, September.
    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. 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.
    2. Mati, Yazid & Dauzère-Pérès, Stèphane & Lahlou, Chams, 2011. "A general approach for optimizing regular criteria in the job-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 212(1), pages 33-42, July.
    3. Burdett, R.L. & Kozan, E., 2009. "Techniques for inserting additional trains into existing timetables," Transportation Research Part B: Methodological, Elsevier, vol. 43(8-9), pages 821-836, 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. Pinar Keskinocak & R. Ravi & Sridhar Tayur, 2001. "Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues," Management Science, INFORMS, vol. 47(2), pages 264-279, February.
    2. Mark L. Spearman & Rachel Q. Zhang, 1999. "Optimal Lead Time Policies," Management Science, INFORMS, vol. 45(2), pages 290-295, February.
    3. Enns, S. T., 1998. "Lead time selection and the behaviour of work flow in job shops," European Journal of Operational Research, Elsevier, vol. 109(1), pages 122-136, August.
    4. Roman Kapuscinski & Sridhar Tayur, 2007. "Reliable Due-Date Setting in a Capacitated MTO System with Two Customer Classes," Operations Research, INFORMS, vol. 55(1), pages 56-74, February.
    5. 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.
    6. Erica L. Plambeck, 2004. "Optimal Leadtime Differentiation via Diffusion Approximations," Operations Research, INFORMS, vol. 52(2), pages 213-228, April.
    7. 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.
    8. Srivastava, Bharatendu & Chen, Wun-Hwa, 1996. "Batching in production planning for flexible manufacturing systems," International Journal of Production Economics, Elsevier, vol. 43(2-3), pages 127-137, June.
    9. ElHafsi, Mohsen, 2000. "An operational decision model for lead-time and price quotation in congested manufacturing systems," European Journal of Operational Research, Elsevier, vol. 126(2), pages 355-370, October.
    10. Raaymakers, W. H. M. & Weijters, A. J. M. M., 2003. "Makespan estimation in batch process industries: A comparison between regression analysis and neural networks," European Journal of Operational Research, Elsevier, vol. 145(1), pages 14-30, February.
    11. Gupta, Jatinder N.D. & Koulamas, Christos & Kyparisis, George J., 2006. "Performance guarantees for flowshop heuristics to minimize makespan," European Journal of Operational Research, Elsevier, vol. 169(3), pages 865-872, March.
    12. 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.
    13. Ramalhinho Lourenco, Helena, 1996. "Sevast'yanov's algorithm for the flow-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 91(1), pages 176-189, May.
    14. M Kumral & P A Dowd, 2005. "A simulated annealing approach to mine production scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 922-930, August.
    15. T.C.E. Cheng & B.M.T. Lin & A. Toker, 2000. "Makespan minimization in the two‐machine flowshop batch scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(2), pages 128-144, March.
    16. Viana, Ana & Pinho de Sousa, Jorge, 2000. "Using metaheuristics in multiobjective resource constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 120(2), pages 359-374, January.
    17. Monaci, Marta & Agasucci, Valerio & Grani, Giorgio, 2024. "An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents," European Journal of Operational Research, Elsevier, vol. 312(3), pages 910-926.
    18. Nicolás Álvarez-Gil & Rafael Rosillo & David de la Fuente & Raúl Pino, 2021. "A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(4), pages 1353-1374, December.
    19. Bertrand, J. W. M. & Sridharan, V., 2001. "A study of simple rules for subcontracting in make-to-order manufacturing," European Journal of Operational Research, Elsevier, vol. 128(3), pages 509-531, February.
    20. M Haouari & T Ladhari, 2003. "A branch-and-bound-based local search method for the flow shop problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(10), pages 1076-1084, 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:91:y:1996:i:1:p:99-117. 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.