Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
2014 | 43 | nr 4 | 531--546
Tytuł artykułu

Time Buffers in the Open Shop Problem

Treść / Zawartość
Warianty tytułu
Języki publikacji
A stability concept for the open shop schedule is proposed. The underlying aim is to protect an organisation against serious problems caused by accumulation of delays in various processes realised in the organisation at the same time. The stability criterion is coupled with that of schedule makespan minimisation. Buffers are used as a tool of ensuring schedule stability. A fuzzy model determining the optimal schedule with respect to both criteria is formulated based on expert opinions as to the desired buffer size and the desired planned makespan. The model is expressed as a mixed integer linear programming model. The approach is illustrated by means of an example. (original abstract)
Opis fizyczny
  • Wrocław University of Technology
  • Aloulu, M.A. and Artigues, C. (2010) Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case. Computers & Operations Research, 37(5), 890-898.
  • Baker, K.R. and Trietsch, D. (2009) Principles of Sequencing and Scheduling. John Wiley & Sons, Inc.
  • Correia, I. and Saldanha-Da-Gama, F. (2014) The impact of fixed and variable costs in a multi-skill project scheduling problem: An empirical study. Computers & Industrial Engineering, 72(0), 230-238.
  • Dong, J., Zhang, A., Chen, Y. and Yang, Q. (2013) Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination. Theoretical Computer Science, 491(0), 94-102.
  • Frostig, E. (1991) On the optimality of static policy in stochastic open shop. Operations Research Letters, 10(9), 509-512.
  • Goldratt, E.M. (1997) Critical Chain. North River Press.
  • Herroelen, W. and Leus, R. (2004) The construction of stable project baseline schedules. European Journal of Operational Research, 156(3), 550-565.
  • Jensen, M.T. (2001) Improving robustness and flexibility of tardiness and total flow-time job shops using robustness measures. Applied Soft Computing, 1(1), 35-52.
  • Kaspersky, A., Kurpisz, A. and Zieliński, P. (2012) Approximating a two-machine flow shop scheduling under discrete scenario uncertainty. European Journal of Operational Research, 217(1), 36-43.
  • Kobylanski, P. and Kuchta, D. (2007) A note on the paper by M. A. Al-Fawzan and M. Haouari about a bi-objective problem for robust resource constrained project scheduling. International Journal of Production Economics, 107(2), 496-501.
  • Kuchta, D. (2014) A new concept of project robust schedule - Use of buffers. Procedia Computer Science, 31(0), 957-965.
  • Low, C. and Yeh, Y. (2009) Genetic algorithm-based heuristics for an open shop scheduling problem with setup, processing, and removal times separated. Robotics and Computer-Integrated Manufacturing, 25(2), 314-322.
  • Noori-Darvish, S., Mahdavi, I. and Mahdavi-Amiri, N. (2012) A biobjective possibilistic programming model for open shop scheduling problems with sequence-dependent setup times, fuzzy processing times, and fuzzy due dates. Applied Soft Computing, 12(4), 1399-1416.
  • Panwalkar, S.S. and Koulamas, C. (2014) The two-machine no-wait general and proportionate open shop makespan problem. European Journal of Operational Research, 238(2), 471-475.
  • Sabuncuoglu, I. and Goren, S. (2009) Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research. International Journal of Computer Integrated Manufacturing, 22(2), 138-157.
  • Slusarczyk, A., Kuchta, D., Verlhust, P., Huyghe, W., Lauryssen, K. and Debal, T. (2013) A comparison of buffer sizing techniques in the critical chain method. Case study. Journal of Automation, Mobile Robotics & Intelligent System, 7(3), 43-56.
  • Xiong, J., Xing, L. and Chen, Y. (2013) Robust scheduling for multiobjective flexible job-shop problems with random machine breakdowns. International Journal of Production Economics, 141(1), 112-126.
  • Zhang, P.-W., Pan, Q.-k., Li, J.-q. and Duan, J.-h. (2013) Hybrid artificial bee colony algorithms for flowshop scheduling problem with limited buffers. Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 19(10), 2510-2520.
Typ dokumentu
Identyfikator YADDA

Zgłoszenie zostało wysłane

Zgłoszenie zostało wysłane

Musisz być zalogowany aby pisać komentarze.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.