Job shop scheduling with a combination of four buffering constraints

Shi Qiang Liu, Erhan Kozan, Mahmoud Masoud, Yu Zhang, Tung Sun Chan

Research output: Journal article publicationJournal articleAcademic researchpeer-review

18 Citations (Scopus)

Abstract

In this paper, a new scheduling problem is investigated in order to optimise a more generalised Job Shop Scheduling system with a Combination of four Buffering constraints (i.e. no-wait, no-buffer, limited-buffer and infinite-buffer) called CBJSS. In practice, the CBJSS is significant in modelling and analysing many real-world scheduling systems in chemical, food, manufacturing, railway, health care and aviation industries. Critical problem properties are thoroughly analysed in terms of the Gantt charts. Based on these properties, an applicable mixed integer programming model is formulated and an efficient heuristic algorithm is developed. Computational experiments show that the proposed heuristic algorithm is satisfactory for solving the CBJSS in real time.
Original languageEnglish
Pages (from-to)3274-3293
Number of pages20
JournalInternational Journal of Production Research
Volume56
Issue number9
DOIs
Publication statusPublished - 3 May 2018

Keywords

  • best-insertion-heuristic algorithm
  • blocking
  • buffer management
  • constructive algorithm
  • job shop scheduling
  • mixed integer programming
  • no-wait

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this