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

Solution of the generalized Townsend single machine scheduling model

Author

Listed:
  • Szwarc, Wlodzimierz
  • Mukhopadhyay, Samar K.

Abstract

No abstract is available for this item.

Suggested Citation

  • Szwarc, Wlodzimierz & Mukhopadhyay, Samar K., 1996. "Solution of the generalized Townsend single machine scheduling model," European Journal of Operational Research, Elsevier, vol. 91(1), pages 203-210, May.
    • Handle: RePEc:eee:ejores:v:91:y:1996:i:1:p:203-210
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(95)00125-5
    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. Wlodzimierz Szwarc & Marc E. Posner & John J. Liu, 1988. "The Single Machine Problem with a Quadratic Cost Function of Completion Times," Management Science, INFORMS, vol. 34(12), pages 1480-1488, December.
    2. Federico Della Croce & Wlodzimierz Szwarc & Roberto Tadei & Paolo Baracco & Raffaele di Tullio, 1995. "Minimizing the weighted sum of quadratic completion times on a single machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(8), pages 1263-1270, December.
    3. Sen, Tapan & Dileepan, Parthasarati & Ruparel, Bharat, 1990. "Minimizing a generalized quadratic penalty function of job completion times: An improved branch-and-bound approach," Engineering Costs and Production Economics, Elsevier, vol. 18(3), pages 197-202, January.
    4. W. Townsend, 1978. "The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution," Management Science, INFORMS, vol. 24(5), pages 530-534, January.
    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. Cheng, T. C. Edwin & Shakhlevich, Natalia V., 2005. "Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 165(2), pages 444-456, September.
    2. Tan, Keah-Choon & Narasimhan, Ram & Rubin, Paul A. & Ragatz, Gary L., 2000. "A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times," Omega, Elsevier, vol. 28(3), pages 313-326, June.

    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. Janiak, Adam & Krysiak, Tomasz & Pappis, Costas P. & Voutsinas, Theodore G., 2009. "A scheduling problem with job values given as a power function of their completion times," European Journal of Operational Research, Elsevier, vol. 193(3), pages 836-848, March.
    2. Cheng, T. C. Edwin & Shakhlevich, Natalia V., 2005. "Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 165(2), pages 444-456, September.
    3. Mondal, Sakib A. & Sen, Anup K., 2000. "An improved precedence rule for single machine sequencing problems with quadratic penalty," European Journal of Operational Research, Elsevier, vol. 125(2), pages 425-428, September.
    4. Schaller, Jeffrey, 2002. "Minimizing the sum of squares lateness on a single machine," European Journal of Operational Research, Elsevier, vol. 143(1), pages 64-79, November.
    5. J-B Wang & J-J Wang & P Ji, 2011. "Scheduling jobs with chain precedence constraints and deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(9), pages 1765-1770, September.
    6. Sen, Tapan & Dileepan, Parthasarati & Lind, Mary R., 1996. "Minimizing a weighted quadratic function of job lateness in the single machine system," International Journal of Production Economics, Elsevier, vol. 42(3), pages 237-243, April.
    7. Ji-Bo Wang & Ming-Zheng Wang, 2011. "Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects," Annals of Operations Research, Springer, vol. 191(1), pages 155-169, November.
    8. Li, Gang & Wang, Xiao-Yuan & Wang, Ji-Bo & Sun, Lin-Yan, 2013. "Worst case analysis of flow shop scheduling problems with a time-dependent learning effect," International Journal of Production Economics, Elsevier, vol. 142(1), pages 98-104.
    9. D-L Yang & W-H Kuo, 2007. "Single-machine scheduling with an actual time-dependent learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(10), pages 1348-1353, October.
    10. Nikhil Bansal & Christoph Dürr & Nguyen Kim Thang & Óscar C. Vásquez, 2017. "The local–global conjecture for scheduling with non-linear cost," Journal of Scheduling, Springer, vol. 20(3), pages 239-254, June.
    11. Tao Ren & Yan Zhang & Shuenn-Ren Cheng & Chin-Chia Wu & Meng Zhang & Bo-yu Chang & Xin-yue Wang & Peng Zhao, 2020. "Effective Heuristic Algorithms Solving the Jobshop Scheduling Problem with Release Dates," Mathematics, MDPI, vol. 8(8), pages 1-25, July.
    12. Kai-biao Sun & Hong-xing Li, 2009. "Some single-machine scheduling problems with actual time and position dependent learning effects," Fuzzy Information and Engineering, Springer, vol. 1(2), pages 161-177, June.
    13. Wang, Ji-Bo, 2007. "Single-machine scheduling problems with the effects of learning and deterioration," Omega, Elsevier, vol. 35(4), pages 397-402, August.
    14. Wlodzimierz Szwarc, 1993. "Adjacent orderings in single‐machine scheduling with earliness and tardiness penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(2), pages 229-243, March.
    15. Xiao, Qian & Xu, Hongquan, 2021. "A mapping-based universal Kriging model for order-of-addition experiments in drug combination studies," Computational Statistics & Data Analysis, Elsevier, vol. 157(C).
    16. Xu, Zhiyong & Sun, Linyan & Gong, Juntao, 2008. "Worst-case analysis for flow shop scheduling with a learning effect," International Journal of Production Economics, Elsevier, vol. 113(2), pages 748-753, June.
    17. Della Croce, Federico, 1995. "Generalized pairwise interchanges and machine scheduling," European Journal of Operational Research, Elsevier, vol. 83(2), pages 310-319, June.
    18. Xiaoqiang Cai & Xiaoqian Sun & Xian Zhou, 2004. "Stochastic scheduling subject to machine breakdowns: The preemptive‐repeat model with discounted reward and other criteria," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(6), pages 800-817, September.
    19. Dar-Li Yang & Wen-Hung Kuo, 2009. "Single-machine scheduling with both deterioration and learning effects," Annals of Operations Research, Springer, vol. 172(1), pages 315-327, November.
    20. J-B Wang, 2010. "Single-machine scheduling with a sum-of-actual-processing-time-based learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(1), pages 172-177, January.

    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:203-210. 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.