IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v25y2022i5d10.1007_s10951-022-00743-9.html
   My bibliography  Save this article

On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates

Author

Listed:
  • Gur Mosheiov

    (The Hebrew University)

  • Daniel Oron

    (The University of Sydney Business School)

  • Dvir Shabtay

    (Ben-Gurion University of the Negev)

Abstract

We study two $$\mathcal {NP}$$ NP -hard single-machine scheduling problems with generalized due-dates. In such problems, due-dates are associated with positions in the job sequence rather than with jobs. Accordingly, the job that is assigned to position j in the job processing order (job sequence), is assigned with a predefined due-date, $$\delta _{j}$$ δ j . In the first problem, the objective consists of finding a job schedule that minimizes the maximal absolute lateness, while in the second problem, we aim to maximize the weighted number of jobs completed exactly at their due-date. Both problems are known to be strongly $$\mathcal {NP}$$ NP -hard when the instance includes an arbitrary number of different due-dates. Our objective is to study the tractability of both problems with respect to the number of different due-dates in the instance, $$\nu _{d}$$ ν d . We show that both problems remain $$ \mathcal {NP}$$ NP -hard even when $$\nu _{d}=2$$ ν d = 2 , and are solvable in pseudo-polynomial time when the value of $$\nu _{d}$$ ν d is upper bounded by a constant. To complement our results, we show that both problems are fixed parameterized tractable (FPT) when we combine the two parameters of number of different due-dates ( $$\nu _{d}$$ ν d ) and number of different processing times ( $$\nu _{p}$$ ν p ).

Suggested Citation

  • Gur Mosheiov & Daniel Oron & Dvir Shabtay, 2022. "On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates," Journal of Scheduling, Springer, vol. 25(5), pages 577-587, October.
  • Handle: RePEc:spr:jsched:v:25:y:2022:i:5:d:10.1007_s10951-022-00743-9
    DOI: 10.1007/s10951-022-00743-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-022-00743-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10951-022-00743-9?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. C. Sriskandarajah, 1990. "A note on the generalized due dates scheduling problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(4), pages 587-597, August.
    2. Enrique Gerstl & Gur Mosheiov, 2020. "Single machine scheduling to maximize the number of on-time jobs with generalized due-dates," Journal of Scheduling, Springer, vol. 23(3), pages 289-299, June.
    3. H. W. Lenstra, 1983. "Integer Programming with a Fixed Number of Variables," Mathematics of Operations Research, INFORMS, vol. 8(4), pages 538-548, November.
    4. 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.
    5. Jianzhong Du & Joseph Y.-T. Leung, 1990. "Minimizing Total Tardiness on One Machine is NP-Hard," Mathematics of Operations Research, INFORMS, vol. 15(3), pages 483-495, August.
    6. K. Tanaka & M. Vlach, 1999. "Minimizing maximum absolute lateness and range of lateness under generalizeddue dates on a single machine," Annals of Operations Research, Springer, vol. 86(0), pages 507-526, January.
    7. Michael R. Garey & Robert E. Tarjan & Gordon T. Wilfong, 1988. "One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties," Mathematics of Operations Research, INFORMS, vol. 13(2), pages 330-348, May.
    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. Li-Han Zhang & Dan-Yang Lv & Ji-Bo Wang, 2023. "Two-Agent Slack Due-Date Assignment Scheduling with Resource Allocations and Deteriorating Jobs," Mathematics, MDPI, vol. 11(12), pages 1-12, 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. Baruch Mor & Gur Mosheiov & Dvir Shabtay, 2021. "Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates," Journal of Scheduling, Springer, vol. 24(6), pages 553-567, December.
    2. Mosheiov, Gur & Oron, Daniel & Shabtay, Dvir, 2021. "Minimizing total late work on a single machine with generalized due-dates," European Journal of Operational Research, Elsevier, vol. 293(3), pages 837-846.
    3. Enrique Gerstl & Gur Mosheiov, 2020. "Single machine scheduling to maximize the number of on-time jobs with generalized due-dates," Journal of Scheduling, Springer, vol. 23(3), pages 289-299, June.
    4. Barketau, M.S. & Cheng, T.C.E. & Kovalyov, M.Y., 2008. "Batch scheduling of deteriorating reworkables," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1317-1326, September.
    5. Inderfurth, Karl & Kovalyov, Mikhail Y. & Ng, C.T. & Werner, Frank, 2007. "Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables," International Journal of Production Economics, Elsevier, vol. 105(2), pages 345-356, February.
    6. 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.
    7. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
    8. John J. Kanet & V. Sridharan, 2000. "Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review," Operations Research, INFORMS, vol. 48(1), pages 99-110, February.
    9. Wang, Du-Juan & Yin, Yunqiang & Xu, Jianyou & Wu, Wen-Hsiang & Cheng, Shuenn-Ren & Wu, Chin-Chia, 2015. "Some due date determination scheduling problems with two agents on a single machine," International Journal of Production Economics, Elsevier, vol. 168(C), pages 81-90.
    10. Lin, B.M.T. & Liu, S.T., 2008. "Maximizing the reward in the relocation problem with generalized due dates," International Journal of Production Economics, Elsevier, vol. 115(1), pages 55-63, September.
    11. K. Aardal & R. E. Bixby & C. A. J. Hurkens & A. K. Lenstra & J. W. Smeltink, 2000. "Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 192-202, August.
    12. Derya Deliktaş, 2022. "Self-adaptive memetic algorithms for multi-objective single machine learning-effect scheduling problems with release times," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 748-784, September.
    13. Alberto Del Pia & Robert Hildebrand & Robert Weismantel & Kevin Zemmer, 2016. "Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 511-530, May.
    14. Baptiste, Philippe & Sadykov, Ruslan, 2010. "Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars," European Journal of Operational Research, Elsevier, vol. 203(2), pages 476-483, June.
    15. Quang Chieu Ta & Jean-Charles Billaut & Jean-Louis Bouquard, 2018. "Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 617-628, March.
    16. Azeddine Cheref & Alessandro Agnetis & Christian Artigues & Jean-Charles Billaut, 2017. "Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence," Journal of Scheduling, Springer, vol. 20(6), pages 681-693, December.
    17. Kolahan, F. & Liang, M., 1998. "An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups," European Journal of Operational Research, Elsevier, vol. 109(1), pages 142-159, August.
    18. Friedrich Eisenbrand & Gennady Shmonin, 2008. "Parametric Integer Programming in Fixed Dimension," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 839-850, November.
    19. Matan Atsmony & Gur Mosheiov, 2023. "Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection," Journal of Scheduling, Springer, vol. 26(2), pages 193-207, April.
    20. A. G. Leeftink & R. J. Boucherie & E. W. Hans & M. A. M. Verdaasdonk & I. M. H. Vliegen & P. J. Diest, 2018. "Batch scheduling in the histopathology laboratory," Flexible Services and Manufacturing Journal, Springer, vol. 30(1), pages 171-197, June.

    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:spr:jsched:v:25:y:2022:i:5:d:10.1007_s10951-022-00743-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.