Job shop scheduling with a combination of four buffering constraints

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 a...

Full description

Saved in:

Bibliographic Details
Published in:	International journal of production research Vol. 56; no. 9; pp. 3274 - 3293
Main Authors:	Liu, Shi Qiang, Kozan, Erhan, Masoud, Mahmoud, Zhang, Yu, Chan, Felix T.S.
Format:	Journal Article
Language:	English
Published:	London Taylor & Francis 03.05.2018 Taylor & Francis LLC
Subjects:	Algorithms best-insertion-heuristic algorithm blocking buffer management Buffers constructive algorithm Gantt charts Heuristic methods Integer programming Job shop scheduling Job shops Mixed integer mixed integer programming no-wait Organic chemistry Production scheduling Scheduling
ISSN:	0020-7543, 1366-588X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!