Performance analysis of commercial offset printing under dynamic priority rules

• Authors: Przemysław KORYTKOWSKI , Tomasz WIŚNIEWSKI
• Languages of publication: EN

Abstracts

EN

A profit analysis of a commercial offset printing production system working under various dynamic priority rules has been undertaken. The task is to investigate both whether and how a change in priority rules affects the system’s performance. A mutual impact of the dynamic priority rule utilized (EDD, LOR, MOR, SPT, and LPT), system workload (by means of machine utilization) and input buffer capacities have been studied.

Keywords

EN

dynamic priority rules; commercial offset printing; simulation

• Publisher: Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
• Journal: Operations Research and Decisions
• Year: 2011
• Volume: 21
• Issue: 1
• Pages: 53-64

Contributors

author

Przemysław KORYTKOWSKI

• West Pomeranian University of Technology, ul. Żołnierska 49, 71-210 Szczecin, Poland

author

Tomasz WIŚNIEWSKI

• West Pomeranian University of Technology, ul. Żołnierska 49, 71-210 Szczecin, Poland

References

• BANKS J., DAI J.G., Simulation studies of multiclass queueing networks, IIE Transactions, 1997, 29, 213–219.
• BEDFORD A., ZEEPHONGSEKUL P., On a dual queueing system with preemptive priority service discipline, European Journal of Operational Research, 2005, 161, 224–239.
• BOON M.A.A., ADAN I.J.B.F., BOXMA O.J., A polling model with multiple priority levels, Performance Evaluation, 2010, 67 (6), 468–484.
• BRAMSON M., Instability of FIFO queueing networks, The Annals of Applied Probability, 1994, 4 (2), 414–431.
• BRANDT A., BRANDT M., On the two-class M/M/1 system under preemptive resume and impatience of the prioritized customers, Queueing Systems, 2004, 47, 147–168.
• CAKAR T., YILDIRIM M.B., A neuro-genetic approach to design and planning of a manufacturing cell, Journal of Intelligent Manufacturing, 2005, 16, 453–462.
• CHEN H., SHEN X., YAO D.D., Brownian approximations of multiclass open-queueing networks, Operations Research, 2002, 50 (6), 1032–1049.
• CHOI B.D., KIM B., CHUNG J., M/M/1 queue with impatient customers of higher priority, Queueing Systems, 2001, 38, 49–66.
• DAI J.G., YEH DH., ZHOU C., The QNET Method for re-entrant queueing networks with priority disciplines, Operations Research, 1997, 45(4), 610–623.
• GROSS D., HARRIS C.M., Fundamentals of Queueing Theory, 3rd Ed., Wiley, New York, 1998.
• GOMEZ-CORRAL A., Analysis of a single-server retrial queue with quasi-random input and nonpreemptive priority, Computers and Mathematics with Applications, 2002, 43, 767–782.
• HARCHOL-BALTER M., OSOGAMI T., SCHELLER-WOLF A., WIERMAN A., Multi-server queueing systems with multiple priority classes, Queueing Systems, 2005, 51, 331–360.
• HERNANDEZ-LERMA O., HOYOS-REYES L.F., A multiobjective control approach to priority queues, Math Operations Research, 2001, 53, 265–277.
• HILL T., Manufacturing Strategy, 2nd Ed., Macmillan, London, 1993.
• IRAVANI F., BALCIOGLU B., On priority queues with impatient customers, Queueing Systems, 2008, 58, 239–260.
• KATAYAMA T., Analysis of a time-limited service priority queueing system with exponential timer and server vacations, Queueing Systems, 2007, 57, 169–178.
• KIM K., CHAE K.C., Discrete-time queues with discretionary priorities, European Journal of Operational Research, 2010, 200, 473–485.
• KORYTKOWSKI P., WIŚNIEWSKI T. ZAIKIN O., Optimal buffer allocation in re-entrant job shop production using simulated annealing, Management and Production Engineering Review, 2010, 1 (3), 30–40.
• KRISHNAMOORTHY A., BABU S., NARAYANAN V.C., The MAP/(PH/PH)/1 queue with self-generation of priorities and non-preemptive service, European Journal of Operational Research, 2009, 195, 174–185.
• KUMAR P.R., Re-entrant lines, Queueing Systems, 1993, 13, 87–110.
• LANGARIS C., Waiting time analysis of a two-stage queueing system with priorities, Queueing Systems, 1993, 14, 457–473.
• LU S.H., KUMAR P.R., Distributed scheduling based on due dates and buffer priorities, IEEE Transactions on Automatic Control, 1991, 36(12), 1406–1416.
• MONTGOMETY D.C., Design and Analysis of Experiments, Wiley, NJ, 2009.
• NARAHARI Y., HEMACHANDRA N., GAUR M.S., Transient analysis of multiclass manufacturing systems with priority scheduling, Computers and Operations Research, 1997, 24 (5), 387–398.
• PARDO M.J., DE LA FUENTE D., Optimizing a priority-discipline queueing model using fuzzy set theory, Computers and Mathematics with Applications, 2007, 54, 267–281.
• SCOTT L.R., HARMONOSKY C.M., An improved simulated annealing simulation optimization method for discrete parameter stochastic systems, Computers and Operations Research, 2005, 32, 343–358.
• SHI C., GERSHWIN S.B., An efficient buffer design algorithm for production line profit maximization, International Journal of Production Economics, 2009, 122, 725–740.
• SLEPTCHENKO A., VAN HARTEN A., VAN DER HEIJDEN M., An Exact Solution for the State Probabilities of the Multi-Class, Multi-Server Queue with Preemptive Priorities, Queueing Systems, 2005, 50, 81–107.
• SONG D.P., HICKS C., EARL C.F., Product due date assignment for complex assemblies, International Journal of Production Economics, 2002, 76, 243–256.
• STANFORD D.A., Waiting and interdeparture time in priority queues with Poisson and general arrival streams, Operations Research, 1997, 45, 725–735.
• TAKAGI H., Queueing Analysis: Vacations and Priority System, Vol. I, North-Holland, Amsterdam, 1991.
• TOPALOGLU S., KILINCLI G., A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization, International Journal of Advanced Manufacturing Technology, 2009, 44, 781–794.
• VAN HOUDT B., BLONDIA C., Analyzing priority queues with 3 classes using tree-like processes, Queueing Systems, 2006, 54, 99–109.
• WALRAEVENS J., STEYAERT B., BRUNEEL H., A preemptive repeat priority queue with resampling. Performance analysis, Annals of Operations Research, 2006, 146, 189–202.
• XIE J., HE Q.-M., ZHAO X., On the stationary distribution of queue lengths in a multi-class priority queueing system with customer transfers, Queueing Systems, 2009, 62, 255–277.
• YILDIRIM M.B., CAKAR T., DOGUC U., MEZA J.C., Machine number, priority rule, and due date determination in flexible manufacturing systems using artificial neural networks, Computers and Industrial Engineering, 2006, 50, 185–194.
• YUZUKIRMIZI M., SMITH J. M. G., Optimal buffer allocation in finite closed networks with multiple servers, Computers and Operations Research, 2008, 35, 2579–2598.