IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v61y2014i1p1-16.html
   My bibliography  Save this article

Single machine just‐in‐time scheduling problems with two competing agents

Author

Listed:
  • Enrique Gerstl
  • Gur Mosheiov

Abstract

In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single‐machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due‐date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP‐hard even for a nonrestrictive due‐date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due‐date (a sufficiently small due‐date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP‐hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 1–16, 2014

Suggested Citation

  • Enrique Gerstl & Gur Mosheiov, 2014. "Single machine just‐in‐time scheduling problems with two competing agents," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(1), pages 1-16, February.
    • Handle: RePEc:wly:navres:v:61:y:2014:i:1:p:1-16
    DOI: 10.1002/nav.21562
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21562
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21562?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
    ---><---

    References listed on IDEAS

    as
    1. Hoogeveen, J. A. & van de Velde, S. L., 1991. "Scheduling around a small common due date," European Journal of Operational Research, Elsevier, vol. 55(2), pages 237-242, November.
    2. Lee, Wen-Chiung & Wu, Chin-Chia & Hsu, Peng-Hsiang, 2010. "A single-machine learning effect scheduling problem with release times," Omega, Elsevier, vol. 38(1-2), pages 3-11, February.
    3. P. S. Sundararaghavan & Mesbah U. Ahmed, 1984. "Minimizing the sum of absolute lateness in single‐machine and multimachine scheduling," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 31(2), pages 325-333, June.
    4. Mor, Baruch & Mosheiov, Gur, 2010. "Scheduling problems with two competing agents to minimize minmax and minsum earliness measures," European Journal of Operational Research, Elsevier, vol. 206(3), pages 540-546, November.
    5. C. T. Ng & T. C. E. Cheng & J. J. Yuan, 2006. "A note on the complexity of the problem of two-agent scheduling on a single machine," Journal of Combinatorial Optimization, Springer, vol. 12(4), pages 387-394, December.
    6. Allesandro Agnetis & Pitu B. Mirchandani & Dario Pacciarelli & Andrea Pacifici, 2004. "Scheduling Problems with Two Competing Agents," Operations Research, INFORMS, vol. 52(2), pages 229-242, April.
    7. John J. Kanet, 1981. "Minimizing the average deviation of job completion times about a common due date," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 28(4), pages 643-651, December.
    8. 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.
    9. 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.
    10. Hino, Celso M. & Ronconi, Debora P. & Mendes, Andre B., 2005. "Minimizing earliness and tardiness penalties in a single-machine problem with a common due date," European Journal of Operational Research, Elsevier, vol. 160(1), pages 190-201, January.
    11. Mor, Baruch & Mosheiov, Gur, 2011. "Single machine batch scheduling with two competing agents to minimize total flowtime," European Journal of Operational Research, Elsevier, vol. 215(3), pages 524-531, December.
    12. Cheng, T.C.E. & Ng, C.T. & Yuan, J.J., 2008. "Multi-agent scheduling on a single machine with max-form criteria," European Journal of Operational Research, Elsevier, vol. 188(2), pages 603-609, July.
    13. Marjan van den Akker & Han Hoogeveen & Steef van de Velde, 2002. "Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem," INFORMS Journal on Computing, INFORMS, vol. 14(1), pages 37-51, February.
    14. Wan, Guohua & Vakati, Sudheer R. & Leung, Joseph Y.-T. & Pinedo, Michael, 2010. "Scheduling two agents with controllable processing times," European Journal of Operational Research, Elsevier, vol. 205(3), pages 528-539, September.
    15. Nicholas G. Hall, 1986. "Single‐ and multiple‐processor models for minimizing completion time variance," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 33(1), pages 49-54, February.
    16. Mosheiov, Gur, 2005. "Minimizing total completion time and total deviation of job completion times from a restrictive due-date," European Journal of Operational Research, Elsevier, vol. 165(1), pages 20-33, August.
    17. 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.
    18. Hamilton Emmons, 1987. "Scheduling to a common due date on parallel uniform processors," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(6), pages 803-810, December.
    19. Uttarayan Bagchi & Yih‐Long Chang & Robert S. Sullivan, 1987. "Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(5), pages 739-751, 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. Yongjian Yang & Guangqiang Yin & Chunyu Wang & Yunqiang Yin, 0. "Due date assignment and two-agent scheduling under multitasking environment," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-17.
    2. Yongjian Yang & Guangqiang Yin & Chunyu Wang & Yunqiang Yin, 2022. "Due date assignment and two-agent scheduling under multitasking environment," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2207-2223, November.
    3. Byung-Cheon Choi & Myoung-Ju Park, 2020. "Scheduling two projects with controllable processing times in a single-machine environment," Journal of Scheduling, Springer, vol. 23(5), pages 619-628, October.
    4. Yunqiang Yin & Youhua Chen & Kaida Qin & Dujuan Wang, 2019. "Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria," Journal of Scheduling, Springer, vol. 22(3), pages 315-333, 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. Shi-Sheng Li & Ren-Xia Chen & Qi Feng, 2016. "Scheduling two job families on a single machine with two competitive agents," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 784-799, October.
    2. 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.
    3. 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.
    4. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    5. Perez-Gonzalez, Paz & Framinan, Jose M., 2014. "A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 1-16.
    6. Du-Juan Wang & Yunqiang Yin & Shuenn-Ren Cheng & T.C.E. Cheng & Chin-Chia Wu, 2016. "Due date assignment and scheduling on a single machine with two competing agents," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 1152-1169, February.
    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. Yaodong Ni & Zhaojun Zhao, 2017. "Two-agent scheduling problem under fuzzy environment," Journal of Intelligent Manufacturing, Springer, vol. 28(3), pages 739-748, March.
    9. Fan, B.Q. & Cheng, T.C.E., 2016. "Two-agent scheduling in a flowshop," European Journal of Operational Research, Elsevier, vol. 252(2), pages 376-384.
    10. Yunqiang Yin & T. C. E. Cheng & Du-Juan Wang & Chin-Chia Wu, 2017. "Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs," Journal of Scheduling, Springer, vol. 20(4), pages 313-335, August.
    11. Sridharan, V. & Zhou, Z., 1996. "A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems," European Journal of Operational Research, Elsevier, vol. 94(2), pages 292-301, October.
    12. Shesh Narayan Sahu & Yuvraj Gajpal & Swapan Debbarma, 2018. "Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives," Annals of Operations Research, Springer, vol. 269(1), pages 623-640, October.
    13. 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.
    14. Omri Dover & Dvir Shabtay, 2016. "Single machine scheduling with two competing agents, arbitrary release dates and unit processing times," Annals of Operations Research, Springer, vol. 238(1), pages 145-178, March.
    15. Jun Pei & Jinling Wei & Baoyu Liao & Xinbao Liu & Panos M. Pardalos, 2020. "Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent," Annals of Operations Research, Springer, vol. 294(1), pages 191-223, November.
    16. 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.
    17. Andreas C. Nearchou & Sotiris L. Omirou, 2024. "Self-Adaptive Biased Differential Evolution for Scheduling Against Common Due Dates," SN Operations Research Forum, Springer, vol. 5(2), pages 1-29, June.
    18. Michael X. Weng & Jose A. Ventura, 1994. "Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(6), pages 843-851, October.
    19. Shang-Chia Liu & Jiahui Duan & Win-Chin Lin & Wen-Hsiang Wu & Jan-Yee Kung & Hau Chen & Chin-Chia Wu, 2018. "A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(05), pages 1-24, October.
    20. Cheng, Shuenn-Ren, 2014. "Some new problems on two-agent scheduling to minimize the earliness costs," International Journal of Production Economics, Elsevier, vol. 156(C), pages 24-30.

    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:wly:navres:v:61:y:2014:i:1:p:1-16. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.