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

Determination of common due window location in a single machine scheduling problem

Author

Listed:
  • Liman, Surya D.
  • Panwalkar, Shrikant S.
  • Thongmee, Sansern

Abstract

No abstract is available for this item.

Suggested Citation

  • Liman, Surya D. & Panwalkar, Shrikant S. & Thongmee, Sansern, 1996. "Determination of common due window location in a single machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 93(1), pages 68-74, August.
    • Handle: RePEc:eee:ejores:v:93:y:1996:i:1:p:68-74
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(95)00181-6
    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. S. S. Panwalkar & M. L. Smith & A. Seidmann, 1982. "Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem," Operations Research, INFORMS, vol. 30(2), pages 391-399, April.
    2. Kenneth R. Baker & Gary D. Scudder, 1990. "Sequencing with Earliness and Tardiness Penalties: A Review," Operations Research, INFORMS, vol. 38(1), pages 22-36, February.
    3. Willard I. Zangwill, 1992. "The Limits of Japanese Production Theory," Interfaces, INFORMS, vol. 22(5), pages 14-25, October.
    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. Gordon, Valery & Proth, Jean-Marie & Chu, Chengbin, 2002. "A survey of the state-of-the-art of common due date assignment and scheduling research," European Journal of Operational Research, Elsevier, vol. 139(1), pages 1-25, May.
    2. Mosheiov, Gur & Sarig, Assaf, 2010. "Scheduling identical jobs and due-window on uniform machines," European Journal of Operational Research, Elsevier, vol. 201(3), pages 712-719, March.
    3. Chung-Yee Lee & Sila Çetinkaya & Albert P.M. Wagelmans, 1999. "A Dynamic Lot-Sizing Model with Demand Time Windows," Tinbergen Institute Discussion Papers 99-095/4, Tinbergen Institute.
    4. Baruch Mor & Gur Mosheiov, 2021. "A note on the single machine CON and CONW problems with lot scheduling," Journal of Combinatorial Optimization, Springer, vol. 42(2), pages 327-338, August.
    5. Janiak, Adam & Janiak, Władysław A. & Krysiak, Tomasz & Kwiatkowski, Tomasz, 2015. "A survey on scheduling problems with due windows," European Journal of Operational Research, Elsevier, vol. 242(2), pages 347-357.
    6. Gerstl, Enrique & Mosheiov, Gur, 2013. "Due-window assignment with identical jobs on parallel uniform machines," European Journal of Operational Research, Elsevier, vol. 229(1), pages 41-47.
    7. Yin, Yunqiang & Cheng, T.C.E. & Hsu, Chou-Jung & Wu, Chin-Chia, 2013. "Single-machine batch delivery scheduling with an assignable common due window," Omega, Elsevier, vol. 41(2), pages 216-225.
    8. Long Zhang & Yuzhong Zhang & Qingguo Bai, 0. "An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-13.
    9. Su, Ling-Huey & Tien, Yi-Yu, 2011. "Minimizing mean absolute deviation of completion time about a common due window subject to maximum tardiness for a single machine," International Journal of Production Economics, Elsevier, vol. 134(1), pages 196-203, November.
    10. Lee, C.Y. & Cetinkaya, S. & Wagelmans, A.P.M., 1999. "A dynamic lot-sizing model with demand time windows," Econometric Institute Research Papers EI 9948-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    11. Chung-Yee Lee & Sila Çetinkaya & Albert P. M. Wagelmans, 2001. "A Dynamic Lot-Sizing Model with Demand Time Windows," Management Science, INFORMS, vol. 47(10), pages 1384-1395, October.
    12. Chen, Zhi-Long & Lee, Chung-Yee, 2002. "Parallel machine scheduling with a common due window," European Journal of Operational Research, Elsevier, vol. 136(3), pages 512-527, February.
    13. Min Ji & Xin Zhang & Xiaoying Tang & T.C.E. Cheng & Guiyi Wei & Yuanyuan Tan, 2016. "Group scheduling with group-dependent multiple due windows assignment," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 1244-1256, February.
    14. Koulamas, Christos & Gupta, Sushil & Kyparisis, George J., 2010. "A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times," European Journal of Operational Research, Elsevier, vol. 205(2), pages 479-482, September.
    15. G Mosheiov & A Sarig, 2008. "A due-window assignment problem with position-dependent processing times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(7), pages 997-1003, July.
    16. G Mosheiov & A Sarig, 2011. "A note: a due-window assignment problem on parallel identical machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 238-241, January.
    17. Hui Zhu & Min Li & Zhangjin Zhou & Yun You, 2016. "Due-window assignment and scheduling with general position-dependent processing times involving a deteriorating and compressible maintenance activity," International Journal of Production Research, Taylor & Francis Journals, vol. 54(12), pages 3475-3490, June.
    18. Biskup, Dirk & Feldmann, Martin, 2005. "On scheduling around large restrictive common due windows," European Journal of Operational Research, Elsevier, vol. 162(3), pages 740-761, May.
    19. Yang, Dar-Li & Lai, Chien-Jung & Yang, Suh-Jenq, 2014. "Scheduling problems with multiple due windows assignment and controllable processing times on a single machine," International Journal of Production Economics, Elsevier, vol. 150(C), pages 96-103.
    20. Long Zhang & Yuzhong Zhang & Qingguo Bai, 2022. "An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2167-2179, November.

    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. Shabtay, Dvir & Steiner, George & Zhang, Rui, 2016. "Optimal coordination of resource allocation, due date assignment and scheduling decisions," Omega, Elsevier, vol. 65(C), pages 41-54.
    2. Prabuddha De & Jay B. Ghosh & Charles E. Wells, 1994. "Due‐date assignment and early/tardy scheduling on identical parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(1), pages 17-32, February.
    3. T C E Cheng & L Kang & C T Ng, 2004. "Due-date assignment and single machine scheduling with deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 198-203, February.
    4. Li, Shisheng & Ng, C.T. & Yuan, Jinjiang, 2011. "Group scheduling and due date assignment on a single machine," International Journal of Production Economics, Elsevier, vol. 130(2), pages 230-235, April.
    5. Enrique Gerstl & Gur Mosheiov, 2013. "Minmax due-date assignment with a time window for acceptable lead-times," Annals of Operations Research, Springer, vol. 211(1), pages 167-177, December.
    6. Qian, Jianbo & Steiner, George, 2013. "Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine," European Journal of Operational Research, Elsevier, vol. 225(3), pages 547-551.
    7. Ramon Alvarez-Valdes & Enric Crespo & Jose Tamarit & Fulgencia Villa, 2012. "Minimizing weighted earliness–tardiness on a single machine with a common due date using quadratic models," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(3), pages 754-767, October.
    8. Biskup, Dirk, 1999. "Single-machine scheduling with learning considerations," European Journal of Operational Research, Elsevier, vol. 115(1), pages 173-178, May.
    9. Bernard Dickman & Yonah Wilamowsky & Sheldon Epstein, 2001. "Multiple common due dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(4), pages 293-298, June.
    10. Zhi-Long Chen, 1997. "Scheduling with batch setup times and earliness-tardiness penalties," European Journal of Operational Research, Elsevier, vol. 96(3), pages 518-537, February.
    11. Chen, Zhi-Long, 1996. "Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs," European Journal of Operational Research, Elsevier, vol. 93(1), pages 49-60, August.
    12. Dvir Shabtay & Nufar Gaspar & Liron Yedidsion, 2012. "A bicriteria approach to scheduling a single machine with job rejection and positional penalties," Journal of Combinatorial Optimization, Springer, vol. 23(4), pages 395-424, May.
    13. Lin, Shih-Wei & Chou, Shuo-Yan & Ying, Kuo-Ching, 2007. "A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date," European Journal of Operational Research, Elsevier, vol. 177(2), pages 1294-1301, March.
    14. Dvir Shabtay & George Steiner, 2008. "The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times," Annals of Operations Research, Springer, vol. 159(1), pages 25-40, March.
    15. T C E Cheng & L Y Kang & C T Ng, 2007. "Due-date assignment and parallel-machine scheduling with deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(8), pages 1103-1108, August.
    16. T. C. E. Cheng & H. G. Kahlbacher, 1991. "A proof for the longest‐job‐first policy in one‐machine scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(5), pages 715-720, October.
    17. Baruch Mor, 2019. "Minmax scheduling problems with common due-date and completion time penalty," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 50-71, July.
    18. Huynh Tuong, Nguyen & Soukhal, Ameur, 2010. "Due dates assignment and JIT scheduling with equal-size jobs," European Journal of Operational Research, Elsevier, vol. 205(2), pages 280-289, September.
    19. Shabtay, Dvir, 2010. "Scheduling and due date assignment to minimize earliness, tardiness, holding, due date assignment and batch delivery costs," International Journal of Production Economics, Elsevier, vol. 123(1), pages 235-242, January.
    20. X. Cai & S. Zhou, 1997. "Scheduling stochastic jobs with asymmetric earliness and tardiness penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(6), pages 531-557, September.

    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:93:y:1996:i:1:p:68-74. 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.