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

A single‐machine problem with multiple criteria

Author

Listed:
  • Ali S. Kiran
  • Ali Tamer Unal

Abstract

The problem considered is that of finding the set of efficient sequences of jobs on a single machine with respect to the total flow time and the number of tardy jobs. We present some properties of an existing algorithm and the problem itself.

Suggested Citation

  • Ali S. Kiran & Ali Tamer Unal, 1991. "A single‐machine problem with multiple criteria," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(5), pages 721-727, October.
    • Handle: RePEc:wly:navres:v:38:y:1991:i:5:p:721-727
    DOI: 10.1002/1520-6750(199110)38:53.0.CO;2-4
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199110)38:53.0.CO;2-4
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199110)38:53.0.CO;2-4?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. Rosser T. Nelson & Rakesh K. Sarin & Richard L. Daniels, 1986. "Scheduling with Multiple Performance Measures: The One-Machine Case," Management Science, INFORMS, vol. 32(4), pages 464-479, April.
    2. Wayne E. Smith, 1956. "Various optimizers for single‐stage production," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 59-66, March.
    3. Hamilton Emmons, 1975. "One machine sequencing to minimize mean flow time with minimum number tardy," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 22(3), pages 585-592, September.
    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. Ching‐Jong Liao & Cheng‐Hsing Chuang, 1996. "Sequencing with setup time and order tardiness trade‐offs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(7), pages 971-984, October.
    2. Murat Güngör, 2016. "A note on efficient sequences with respect to total flow time and number of tardy jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(4), pages 346-348, June.
    3. Chen, Rubing & Yuan, Jinjiang & Ng, C.T. & Cheng, T.C.E., 2021. "Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion," European Journal of Operational Research, Elsevier, vol. 293(1), pages 79-92.
    4. Suna Köksalan Kondakci & Meral Azizoglu & Murat Köksalan, 1996. "Note: Bicriteria scheduling for minimizing flow time and maximum tardiness," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(6), pages 929-936, September.

    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. Murat Güngör, 2016. "A note on efficient sequences with respect to total flow time and number of tardy jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(4), pages 346-348, June.
    2. Suna Köksalan Kondakci & Meral Azizoglu & Murat Köksalan, 1996. "Note: Bicriteria scheduling for minimizing flow time and maximum tardiness," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(6), pages 929-936, September.
    3. Vincent T’kindt & Karima Bouibede-Hocine & Carl Esswein, 2007. "Counting and enumeration complexity with application to multicriteria scheduling," Annals of Operations Research, Springer, vol. 153(1), pages 215-234, September.
    4. Subhash C. Sarin & Divya Prakash, 2004. "Equal Processing Time Bicriteria Scheduling on Parallel Machines," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 227-240, September.
    5. Chen, Rubing & Yuan, Jinjiang & Ng, C.T. & Cheng, T.C.E., 2021. "Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion," European Journal of Operational Research, Elsevier, vol. 293(1), pages 79-92.
    6. Marieke Quant & Marc Meertens & Hans Reijnierse, 2008. "Processing games with shared interest," Annals of Operations Research, Springer, vol. 158(1), pages 219-228, February.
    7. Lili Liu & Guochun Tang & Baoqiang Fan & Xingpeng Wang, 2015. "Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 938-948, November.
    8. van Beek, Andries & Malmberg, Benjamin & Borm, Peter & Quant, Marieke & Schouten, Jop, 2021. "Cooperation and Competition in Linear Production and Sequencing Processes," Discussion Paper 2021-011, Tilburg University, Center for Economic Research.
    9. Reijnierse, Hans & Borm, Peter & Quant, Marieke & Meertens, Marc, 2010. "Processing games with restricted capacities," European Journal of Operational Research, Elsevier, vol. 202(3), pages 773-780, May.
    10. Borm, Peter & Fiestras-Janeiro, Gloria & Hamers, Herbert & Sanchez, Estela & Voorneveld, Mark, 2002. "On the convexity of games corresponding to sequencing situations with due dates," European Journal of Operational Research, Elsevier, vol. 136(3), pages 616-634, February.
    11. Rubing Chen & Jinjiang Yuan, 2020. "Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices," 4OR, Springer, vol. 18(2), pages 177-196, June.
    12. Ravindran Vijayalakshmi, Vipin & Schröder, Marc & Tamir, Tami, 2024. "Minimizing total completion time with machine-dependent priority lists," European Journal of Operational Research, Elsevier, vol. 315(3), pages 844-854.
    13. Hanane Krim & Rachid Benmansour & David Duvivier & Daoud Aït-Kadi & Said Hanafi, 2020. "Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance," Computational Optimization and Applications, Springer, vol. 75(1), pages 291-320, January.
    14. M. Musegaas & P. E. M. Borm & M. Quant, 2018. "On the convexity of step out–step in sequencing games," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(1), pages 68-109, April.
    15. Musegaas, M. & Borm, P.E.M. & Quant, M., 2015. "Step out–Step in sequencing games," European Journal of Operational Research, Elsevier, vol. 246(3), pages 894-906.
    16. Atay, Ata & Trudeau, Christian, 2024. "Queueing games with an endogenous number of machines," Games and Economic Behavior, Elsevier, vol. 144(C), pages 104-125.
    17. Miri Gilenson & Dvir Shabtay & Liron Yedidsion & Rohit Malshe, 2021. "Scheduling in multi-scenario environment with an agreeable condition on job processing times," Annals of Operations Research, Springer, vol. 307(1), pages 153-173, December.
    18. Agnetis, Alessandro & Chen, Bo & Nicosia, Gaia & Pacifici, Andrea, 2019. "Price of fairness in two-agent single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 276(1), pages 79-87.
    19. Yang, Guangjing & Sun, Hao & Hou, Dongshuang & Xu, Genjiu, 2019. "Games in sequencing situations with externalities," European Journal of Operational Research, Elsevier, vol. 278(2), pages 699-708.
    20. Awi Federgruen & Gur Mosheiov, 1993. "Simultaneous optimization of efficiency and performance balance measures in single‐machine scheduling problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(7), pages 951-970, December.

    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:38:y:1991:i:5:p:721-727. 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.