Solving comprehensive dynamic job shop scheduling problem by using a GRASP-based approach


Baykasoglu A., Karaslan F. S.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, cilt.55, ss.3308-3325, 2017 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 55 Konu: 11
  • Basım Tarihi: 2017
  • Doi Numarası: 10.1080/00207543.2017.1306134
  • Dergi Adı: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
  • Sayfa Sayıları: ss.3308-3325

Özet

There are many dynamic events like new order arrivals, machine breakdowns, changes in due dates, order cancellations, arrival of urgent orders etc. that makes static scheduling approaches very difficult. A dynamic scheduling strategy should be adopted under such production circumstances. In the present study an event driven dynamic job shop scheduling mechanism under machine capacity constraints is proposed. The proposed method makes use of the greedy randomised adaptive search procedure (GRASP) by also taking into account orders due dates and sequence-dependent set-up times. Moreover, order acceptance/rejection decision and Order Review Release mechanism are integrated with scheduling decision in order to meet customer due date requirements while attempting to execute capacity adjustments. We employed a goal programming-based logic which is used to evaluate four objectives: mean tardiness, schedule unstability, makespan and mean flow time. Benchmark problems including number of orders, number of machines and different dynamic events are generated. In addition to event-driven rescheduling strategy, a periodic rescheduling strategy is also devised and both strategies are compared for different problems. Experimental studies are performed to evaluate effectiveness of the proposed method. Obtained results have proved that the proposed method is a feasible approach for rescheduling problems under dynamic environments.