BibTex RIS Cite

BİR DİKİM ATÖLYESİNDE BÜTÜNLEŞİK KAPASİTE ARTIRIMI VE ÇİZELGELEME KARARLARI

Year 2010, Volume: 20 Issue: 4, 366 - 372, 01.12.2010

Deniz Türsel Eliiyi

Abstract

Bu çalışmada bir dikim atölyesinde kapasite artırımı ve iş/makine çizelgeleme problemleri bütünleşik olarak ele alınmıştır. Literatürde bu problemler ayrı ayrı çalışılmış olsa da bütünleşik yaklaşımı içeren bir çalışmaya rastlanmamıştır. Problem matematiksel olarak modellenmiş ve karar vericiye yardımcı olacak tekrarlı bir çözüm yaklaşımı geliştirilmiştir. Geliştirilen yaklaşımın çalışma ilkeleri bir dikim atölyesi örneği üzerinde gösterilmiştir. Sonuçlar gelecek çalışma konusu öneriyle birlikte tartışılmıştır

Keywords

Kapasite artırımı problemi Atölye çizelgelemesi Aralık çizelgeleme Operasyonel çizelgeleme problemi Taktik çizelgeleme problemi

References

  • 1. Richardson J., 1996, “Vertical integration and rapid response in fashion apparel”, Organization Science, 7, 400-412.
  • 2. Jain A.S., Meeran S., 1999, “Deterministic job-shop scheduling: Past, present and future”, European Journal of Operational Research, 113, 390-434.
  • 3. Heizer J., Render B., 2006, Principles of Operations Management, 7th Ed., Prentice Hall, New Jersey.
  • 4. Eliiyi D.T., 2004, “Operational Fixed Job Scheduling Problem”, Ph.D. Thesis, Industrial Engineering Department, Middle East Technical University, Ankara, Turkey..
  • 5. Eliiyi D.T., Azizoğlu M., 2006, “Spread time constraints in operational fixed job scheduling”, International Journal of Production Research, 44, 4343-4365.
  • 6. Eliiyi D.T., Azizoğlu M., 2009, “A Fixed Job Scheduling Problem with Machine-Dependent Job Weights”, International Journal of Production Research, 47, 2231 - 2256.
  • 7. Eliiyi D.T., Azizoğlu M., 2009, “Working time constraints in operational fixed job scheduling”, International Journal of Production Research, in press.
  • 8. Kroon L.G., Salomon M., Van Wassenhove L.N., 1995, “Exact and Approximation Algorithms for the Operational Fixed Interval Scheduling Problem”, European Journal of Operational Research, 82, 190-205.
  • 9. Kroon L.G., Salomon M., Van Wassenhove L.N., 1997, “Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem”, Operations Research, 4, 624-638.
  • 10. Arkin A.M., Silverberg E.L., 1987, “Scheduling Jobs with Fixed Start and End Times”, Discrete Applied Mathematics, 18, 1-8.
  • 11. Kolen A.J.W., Kroon L.G., 1991, “On the Computational Complexity of (Maximum) Class Scheduling”, European Journal of Operational Research, 54, 23-38.
  • 12. Kolen A.J.W., Kroon L.G., 1992, “License Class Design: Complexity and Algorithms”, European Journal of Operational Research, 63, 432-444.
  • 13. Kovalyov M.Y., Ng C.T., Cheng T.C.E., 2007, “Fixed interval scheduling: Models, applications, computational complexity and algorithms”, European Journal of Operational Research, 178, 331-342.
  • 14. Kolen A.J.W., Lenstra J.K., Papadimitriou C.H., Spieksma F.C.R., 2007, “Interval scheduling: A survey”, Naval Research Logistics, 54, 530 - 543.
  • 15. Bouzina K.I., Emmons H., 1996, “Interval Scheduling on Identical Machines”, Journal of Global Optimization, 9, 379-393.
  • 16. Eliiyi D.T., Korkmaz A.G., Çiçek A.E., 2009, “Operational Variable Job Scheduling with Eligibility Constraints: A Randomized ConstraintGraph-Based Approach”, Technological and Economic Development of Economy, 15, 245 - 266.
  • 17. Hashimoto A., Stevens J.E., 1971, “Wire Routing by Optimizing Channel Assignments within Large Apertures”, in: Proceedings of the 8th Design Automation Workshop, 155-169.
  • 18. Fischetti M., Martello S., Toth P., 1987, “The Fixed Job Schedule Problem with Spread-Time Constraints”, Operations Research, 35, 849-858.
  • 19. Fischetti M., Martello S., Toth P., 1989, “The Fixed Job Schedule Problem with Working-Time Constraints”, Operations Research, 37, 395-403.
  • 20. Fischetti M., Martello S., Toth P., 1992, “Approximation Algorithms for Fixed Job Schedule Problems”, Operations Research, 40, S96- S108.

INTEGRATED CAPACITY EXPANSION AND SCHEDULING DECISIONS IN A SEWING WORKSHOP

Year 2010, Volume: 20 Issue: 4, 366 - 372, 01.12.2010

Deniz Türsel Eliiyi

Abstract

In this study, we consider the integrated problem of capacity expansion planning and job/machine scheduling in a sewing workshop. The separate problems have been studied before; however the important integrated decision has not been previously dealt with. We model the problem mathematically and develop an iterative solution approach to aid the decision maker. We demonstrate the execution of the approach on a sewing workshop example. The results are discussed together with future research directions

Keywords

Capacity expansion problem Workshop scheduling Interval scheduling Operational scheduling problem Tactical scheduling problem

References

  • 1. Richardson J., 1996, “Vertical integration and rapid response in fashion apparel”, Organization Science, 7, 400-412.
  • 2. Jain A.S., Meeran S., 1999, “Deterministic job-shop scheduling: Past, present and future”, European Journal of Operational Research, 113, 390-434.
  • 3. Heizer J., Render B., 2006, Principles of Operations Management, 7th Ed., Prentice Hall, New Jersey.
  • 4. Eliiyi D.T., 2004, “Operational Fixed Job Scheduling Problem”, Ph.D. Thesis, Industrial Engineering Department, Middle East Technical University, Ankara, Turkey..
  • 5. Eliiyi D.T., Azizoğlu M., 2006, “Spread time constraints in operational fixed job scheduling”, International Journal of Production Research, 44, 4343-4365.
  • 6. Eliiyi D.T., Azizoğlu M., 2009, “A Fixed Job Scheduling Problem with Machine-Dependent Job Weights”, International Journal of Production Research, 47, 2231 - 2256.
  • 7. Eliiyi D.T., Azizoğlu M., 2009, “Working time constraints in operational fixed job scheduling”, International Journal of Production Research, in press.
  • 8. Kroon L.G., Salomon M., Van Wassenhove L.N., 1995, “Exact and Approximation Algorithms for the Operational Fixed Interval Scheduling Problem”, European Journal of Operational Research, 82, 190-205.
  • 9. Kroon L.G., Salomon M., Van Wassenhove L.N., 1997, “Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem”, Operations Research, 4, 624-638.
  • 10. Arkin A.M., Silverberg E.L., 1987, “Scheduling Jobs with Fixed Start and End Times”, Discrete Applied Mathematics, 18, 1-8.
  • 11. Kolen A.J.W., Kroon L.G., 1991, “On the Computational Complexity of (Maximum) Class Scheduling”, European Journal of Operational Research, 54, 23-38.
  • 12. Kolen A.J.W., Kroon L.G., 1992, “License Class Design: Complexity and Algorithms”, European Journal of Operational Research, 63, 432-444.
  • 13. Kovalyov M.Y., Ng C.T., Cheng T.C.E., 2007, “Fixed interval scheduling: Models, applications, computational complexity and algorithms”, European Journal of Operational Research, 178, 331-342.
  • 14. Kolen A.J.W., Lenstra J.K., Papadimitriou C.H., Spieksma F.C.R., 2007, “Interval scheduling: A survey”, Naval Research Logistics, 54, 530 - 543.
  • 15. Bouzina K.I., Emmons H., 1996, “Interval Scheduling on Identical Machines”, Journal of Global Optimization, 9, 379-393.
  • 16. Eliiyi D.T., Korkmaz A.G., Çiçek A.E., 2009, “Operational Variable Job Scheduling with Eligibility Constraints: A Randomized ConstraintGraph-Based Approach”, Technological and Economic Development of Economy, 15, 245 - 266.
  • 17. Hashimoto A., Stevens J.E., 1971, “Wire Routing by Optimizing Channel Assignments within Large Apertures”, in: Proceedings of the 8th Design Automation Workshop, 155-169.
  • 18. Fischetti M., Martello S., Toth P., 1987, “The Fixed Job Schedule Problem with Spread-Time Constraints”, Operations Research, 35, 849-858.
  • 19. Fischetti M., Martello S., Toth P., 1989, “The Fixed Job Schedule Problem with Working-Time Constraints”, Operations Research, 37, 395-403.
  • 20. Fischetti M., Martello S., Toth P., 1992, “Approximation Algorithms for Fixed Job Schedule Problems”, Operations Research, 40, S96- S108.
There are 20 citations in total.

Details

Other ID JA88CF37FR
Journal Section Articles
Authors

Deniz Türsel Eliiyi This is me

Publication Date December 1, 2010
Submission Date December 1, 2010
Published in Issue Year 2010 Volume: 20 Issue: 4

Cite

APA Türsel Eliiyi, D. (2010). INTEGRATED CAPACITY EXPANSION AND SCHEDULING DECISIONS IN A SEWING WORKSHOP. Textile and Apparel, 20(4), 366-372.

No part of this journal may be reproduced, stored, transmitted or disseminated in any forms or by any means without prior written permission of the Editorial Board. The views and opinions expressed here in the articles are those of the authors and are not the views of Tekstil ve Konfeksiyon and Textile and Apparel Research-Application Center.