Efficient priority rules for dynamic sequencing with sequence-dependent setups

Abstract: This article addresses the problem of dynamic sequencing on n identical parallel machines with stochastic arrivals, processing times, due dates and sequence-dependent setups. The system operates under a completely reactive scheduling policy and the sequence of jobs is determined with the use of dispatching rules. Seventeen existing dispatching rules are considered including standard and setup-oriented rules. The performance of the system is evaluated by four metrics. An experimental study of the system is conducted where the effect of categorical and continuous system parameters on the objective functions is examined. In light of the results from the simulation experiments, a parameterized priority rule is introduced and tested. The simulation output is analyzed using rigorous statistical methods and the proposed rule is found to produce significantly better results regarding the metrics of mean cycle time and mean tardiness in single machine cases. In respect to three machine cases, the proposed rule matches the performance of the best rule from the set of existing rules which were studied in this research for three metrics.

How to cite this paper

 Xanthopoulos, A., Koulouriotis, D., Gasteratos, A & Ioannidis, S. (2016). Efficient priority rules for dynamic sequencing with sequence-dependent setups.International Journal of Industrial Engineering Computations , 7(3), 367-384.

Refrences

Adibi, M. A., Zandieh, M., & Amiri, M. (2010). Multi-objective scheduling of dynamic job shop using variable neighborhood search. Expert Systems with Applications, 37(1), 282-287.

Allahverdi, A., Ng, C. T., Cheng, T. C. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985-1032.

Ang, A. T. H., Sivakumar, A. I., & Qi, C. (2009). Criteria selection and analysis for single machine dynamic on-line scheduling with multiple objectives and sequence-dependent setups. Computers & Industrial Engineering, 56(4), 1223-1231.

Arzi, Y., Raviv, D. (1998). Dispatching in a workstation belonging to a re-entrant production line under sequence dependent set-up times. Production Planning & Control, 9(7), 690–699.

Chan, F. T. S., Wong, T. C., & Chan, L. Y. (2006). Flexible job-shop scheduling problem under resource constraints. International Journal of Production Research, 44(11), 2071–89.

Chiang, T.C., Fu, L.C. (2009). Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times. European Journal of Operational Research, 196 (1), 78–92.

Dominic, P. D. D., Kaliyamoorthy, S.M., & Kumar, S. (2004). Efficient dispatching rules for dynamic job shop scheduling. International Journal of Advanced Manufacturing Technology, 24(1-2), 70-75.

Frazier, G.V. (1996). An evaluation of group scheduling heuristics in a flow-line manufacturing cell. International Journal of Production Research, 34(4), 959–976.

Gavett, J.W. (1965). Three heuristic rules for sequencing jobs to a single production facility. Management Science, 11(8), B166–B176.

Huq, F., Cutright, K., & Bhutta, M. K. S. (2009). The analysis of scheduling rules for non-zero setup costs. International Journal of Technology, Policy and Management, 9(2), 126-147.

Jacobs, F.R., Bragg, D.J. (1988). Repetitive lots: Flow-time reductions through sequencing and dynamic batch sizing. Decision Sciences, 19(2), 281–294.

Kim, S.C., Bobrowski, P.M. (1994). Impact of sequence-dependent setup time on job shop scheduling performance.International Journal of Production Research, 32(7), 1503–1520.

Kim, S.C., Bobrowski, P.M. (1997). Scheduling jobs with uncertain setup times and sequence dependency. Omega, 25(4), 437-44.

Korytkowski, P., Wi?niewski, T., & Rymaszewski, S. (2013). An evolutionary simulation-based optimization approach for dispatching scheduling. Simulation Modeling Practice and Theory, 35, 69-85.

Lee, Y.H., Bhaskaran, K., & Pinedo, M. (1997). A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions, 29(1), 45–52.

Mahmoodi, F., Dooley, K.J. (1991). A comparison of exhaustive and non-exhaustive group scheduling heuristics in a manufacturing cell. International Journal of Production Research, 29(9), 1923–1939.

Milliken, G. A., Johnson, D. E. (1992). Analysis of Messy Data, Volume 1: Designed Experiments, Boca Raton, FL: Chapman & Hall/CRC Press.

Nomden, G., van der Zee, D.J., & Slomp, J. (2008). Family-based dispatching: anticipating future jobs. International Journal of Production Research, 46(1), 73–97.

Pickardt, C. W., Branke, J., (2012). Setup-oriented dispatching rules – a survey, International Journal of Production Research, 50(20), 5823-5842.

Rajendran, C., Holthaus, O., (1999). A comparative study of dispatching rules in dynamic flowshops and jobshops. European Journal of Operational Research, 116(1), 156-170.

Vinod, V., Sridharan, R., (2008). Scheduling a dynamic job shop production system with sequence-dependent setups: An experimental study. Robotics and Computer-Integrated Manufacturing, 24(3), 435-449.

Wemmerlov, U., (1992). Fundamental insights into part family scheduling: the single machine case. Decision Sciences, 23(3), 565–595.

Wilbrecht, J.K., Prescott, W.B., (1969). The influence of setup time on job shop performance. Management Science, 16(4), B274–B280.

Xanthopoulos, A. S., Koulouriotis, D. E., Tourassis, V. D., & Emiris, D. M., (2013) Intelligent controllers for bi-objective dynamic scheduling on asingle machine with sequence-dependent setups. Applied Soft Computing, 13(12), 4704-4717.

Zhu, X., Wilhelm, W. E., (2006). Scheduling and lot-sizing with sequence-dependent setup: A literature review. IIE Transactions, 38(11), 987-1007.