IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v7y2019i6p561-d241570.html
   My bibliography  Save this article

Shift Scheduling with the Goal Programming Method: A Case Study in the Glass Industry

Author

Listed:
  • Özlem Kaçmaz

    (Department of Industrial Engineering, Kirikkale University, Kirikkale 71450, Turkey)

  • Haci Mehmet Alakaş

    (Department of Industrial Engineering, Kirikkale University, Kirikkale 71450, Turkey)

  • Tamer Eren

    (Department of Industrial Engineering, Kirikkale University, Kirikkale 71450, Turkey)

Abstract

Nowadays, resource utilization and management are very important for businesses. They try to make a profit by providing high levels of efficiency from available sources. Their labor force is one of these sources. Therefore, scheduling based on personnel satisfaction has become an important problem in recent years. In this study, a case study was carried out in a glass factory in Ankara which has 7 department and 80 personnel. The aim of the study is to provide better service by distributing personnel to shifts in a fair and balanced manner. Assignment points are different for the departments where the personnel will work. Every personnel member is assigned to the department as best as possible. A goal programming method was used, and the results were better than those obtained using other methods.

Suggested Citation

  • Özlem Kaçmaz & Haci Mehmet Alakaş & Tamer Eren, 2019. "Shift Scheduling with the Goal Programming Method: A Case Study in the Glass Industry," Mathematics, MDPI, vol. 7(6), pages 1-22, June.
    • Handle: RePEc:gam:jmathe:v:7:y:2019:i:6:p:561-:d:241570
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/7/6/561/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/7/6/561/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ulusam Seckiner, Serap & Gokcen, Hadi & Kurt, Mustafa, 2007. "An integer programming model for hierarchical workforce scheduling problem," European Journal of Operational Research, Elsevier, vol. 183(2), pages 694-699, December.
    2. Castillo, Ignacio & Joro, Tarja & Li, Yong Yue, 2009. "Workforce scheduling with multiple objectives," European Journal of Operational Research, Elsevier, vol. 196(1), pages 162-170, July.
    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. Mustafa Hamurcu & Tamer Eren, 2023. "Multicriteria decision making and goal programming for determination of electric automobile aimed at sustainable green environment: a case study," Environment Systems and Decisions, Springer, vol. 43(2), pages 211-231, 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. Ağralı, Semra & Taşkın, Z. Caner & Ünal, A. Tamer, 2017. "Employee scheduling in service industries with flexible employee availability and demand," Omega, Elsevier, vol. 66(PA), pages 159-169.
    2. Van den Bergh, Jorne & Beliën, Jeroen & De Bruecker, Philippe & Demeulemeester, Erik & De Boeck, Liesje, 2013. "Personnel scheduling: A literature review," European Journal of Operational Research, Elsevier, vol. 226(3), pages 367-385.
    3. Kaan Kuzu & Refik Soyer, 2018. "Bayesian modeling of abandonments in ticket queues," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(6-7), pages 499-521, September.
    4. Ran Liu & Xiaolan Xie, 2018. "Physician Staffing for Emergency Departments with Time-Varying Demand," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 588-607, August.
    5. Defraeye, Mieke & Van Nieuwenhuyse, Inneke, 2016. "Staffing and scheduling under nonstationary demand for service: A literature review," Omega, Elsevier, vol. 58(C), pages 4-25.
    6. Kheybari, Siamak & Bokaeyan, Amir & Yazd, Seyed Ali Naji Nasrabadi, 2020. "Efficient Harvesting of Saffron Using Integer Programming," International Journal of Agricultural Management and Development (IJAMAD), Iranian Association of Agricultural Economics, vol. 10(3), September.
    7. Mark W. Isken & Osman T. Aydas, 2022. "A tactical multi-week implicit tour scheduling model with applications in healthcare," Health Care Management Science, Springer, vol. 25(4), pages 551-573, December.
    8. E. Borgonovo & L. Peccati, 2011. "Managerial insights from service industry models: a new scenario decomposition method," Annals of Operations Research, Springer, vol. 185(1), pages 161-179, May.
    9. Marta Rocha & José Oliveira & Maria Carravilla, 2014. "A constructive heuristic for staff scheduling in the glass industry," Annals of Operations Research, Springer, vol. 217(1), pages 463-478, June.
    10. Sanja Petrovic, 2019. "“You have to get wet to learn how to swim” applied to bridging the gap between research into personnel scheduling and its implementation in practice," Annals of Operations Research, Springer, vol. 275(1), pages 161-179, April.
    11. De Bruecker, Philippe & Van den Bergh, Jorne & Beliën, Jeroen & Demeulemeester, Erik, 2015. "Workforce planning incorporating skills: State of the art," European Journal of Operational Research, Elsevier, vol. 243(1), pages 1-16.
    12. Lin, Shih-Wei & Ying, Kuo-Ching, 2014. "Minimizing shifts for personnel task scheduling problems: A three-phase algorithm," European Journal of Operational Research, Elsevier, vol. 237(1), pages 323-334.
    13. Falcón, Raúl & Barrena, Eva & Canca, David & Laporte, Gilbert, 2016. "Counting and enumerating feasible rotating schedules by means of Gröbner bases," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 125(C), pages 139-151.
    14. Cambini, Riccardo & Riccardi, Rossana, 2009. "Theoretical and algorithmic results for a class of hierarchical fleet mix problems," European Journal of Operational Research, Elsevier, vol. 198(3), pages 741-747, November.
    15. Gregor Selinka & Raik Stolletz & Thomas I. Maindl, 2022. "Performance Approximation for Time-Dependent Queues with Generally Distributed Abandonments," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 20-38, January.

    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:gam:jmathe:v:7:y:2019:i:6:p:561-:d:241570. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.