IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v35y2018i06ns021759591850046x.html
   My bibliography  Save this article

Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals

Author

Listed:
  • Byung-Cheon Choi

    (School of Business, Chungnam National University, 99 Daehak-ro, Yuseong-gu, Daejeon 34134, Korea)

  • Myoung-Ju Park

    (Department of Industrial and Management Systems Engineering, Kyung Hee University, 1732, Deogyeong-daero, Giheung-gu, Yongin-si, Kyunggi-do 17104, Korea)

Abstract

We consider a single-machine scheduling problem such that the due dates are assigned not to the jobs but to the position at which the job is processed. We focus on the case with identical due date intervals. The objective is to minimize the weighted number of early and tardy jobs. First, we show that the problem is strongly NP-hard and has no ρ-approximation algorithm for any fixed value ρ > 1. Then, we investigate polynomially solvable cases. Finally, we show that the preemption version is weakly NP-hard through its equivalence to the problem of minimizing the weighted number of tardy jobs.

Suggested Citation

  • Byung-Cheon Choi & Myoung-Ju Park, 2018. "Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(06), pages 1-13, December.
    • Handle: RePEc:wsi:apjorx:v:35:y:2018:i:06:n:s021759591850046x
    DOI: 10.1142/S021759591850046X
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S021759591850046X
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S021759591850046X?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
    ---><---

    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. Nicholas G. Hall & Marc E. Posner, 1991. "Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date," Operations Research, INFORMS, vol. 39(5), pages 836-846, October.
    2. Hall, Nicholas G. & Sethi, Suresh P. & Sriskandarajah, Chelliah, 1991. "On the complexity of generalized due date scheduling problems," European Journal of Operational Research, Elsevier, vol. 51(1), pages 100-109, March.
    3. Nicholas G. Hall & Wieslaw Kubiak & Suresh P. Sethi, 1991. "Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date," Operations Research, INFORMS, vol. 39(5), pages 847-856, 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. Myoung-Ju Park & Byung-Cheon Choi & Yunhong Min & Kyung Min Kim, 2020. "Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(01), pages 1-16, January.
    2. Byung-Cheon Choi & Myoung-Ju Park, 2021. "Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 781-793, May.

    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. Byung-Cheon Choi & Myoung-Ju Park, 2021. "Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 781-793, May.
    2. 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.
    3. X. Cai & F. S. Tu, 1996. "Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early‐tardy penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(8), pages 1127-1146, December.
    4. Li, Y. & Ip, W. H. & Wang, D. W., 1998. "Genetic algorithm approach to earliness and tardiness production scheduling and planning problem," International Journal of Production Economics, Elsevier, vol. 54(1), pages 65-76, January.
    5. Philip Kaminsky & Onur Kaya, 2008. "Scheduling and due‐date quotation in a make‐to‐order supply chain," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(5), pages 444-458, August.
    6. 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.
    7. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    8. Ali Kordmostafapour & Javad Rezaeian & Iraj Mahdavi & Mahdi Yar Farjad, 2022. "Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1438-1470, December.
    9. Feifeng Zheng & E. Zhang & Yinfeng Xu & Wei-Chiang Hong, 2014. "Competitive analysis for make-to-order scheduling with reliable lead time quotation," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 182-198, January.
    10. Chung‐Lun Li & Edward C. Sewell & T. C. E. Cheng, 1995. "Scheduling to minimize release‐time resource consumption and tardiness penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 949-966, September.
    11. Cai, X. & Lum, V. Y. S. & Chan, J. M. T., 1997. "Scheduling about a common due date with kob-dependent asymmetric earliness and tardiness penalties," European Journal of Operational Research, Elsevier, vol. 98(1), pages 154-168, April.
    12. Yuan, Jinjiang, 1996. "A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs," European Journal of Operational Research, Elsevier, vol. 94(1), pages 203-205, October.
    13. N. V. R. Mahadev & Aleksandar Pekeč & Fred S. Roberts, 1998. "On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal?," Operations Research, INFORMS, vol. 46(3-supplem), pages 120-134, June.
    14. Kerem Bülbül & Safia Kedad-Sidhoum & Halil Şen, 2019. "Single-machine common due date total earliness/tardiness scheduling with machine unavailability," Journal of Scheduling, Springer, vol. 22(5), pages 543-565, October.
    15. Mosheiov, Gur & Shadmon, Michal, 2001. "Minmax earliness-tardiness costs with unit processing time jobs," European Journal of Operational Research, Elsevier, vol. 130(3), pages 638-652, May.
    16. 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.
    17. Hendel, Yann & Sourd, Francis, 2006. "Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem," European Journal of Operational Research, Elsevier, vol. 173(1), pages 108-119, August.
    18. Salassi, Michael E. & Garcia, Mercedes & Breaux, Janis B. & No, Sung Chul, 2004. "Impact of Sugarcane Delivery Schedule on Product Value at Raw Sugar Factories," Journal of Agribusiness, Agricultural Economics Association of Georgia, vol. 22(1), pages 1-15.
    19. 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.
    20. 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.

    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:wsi:apjorx:v:35:y:2018:i:06:n:s021759591850046x. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.