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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	International journal of production research Ročník 56; číslo 9; s. 3274 - 3293
Hlavní autori:	Liu, Shi Qiang, Kozan, Erhan, Masoud, Mahmoud, Zhang, Yu, Chan, Felix T.S.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London Taylor & Francis 03.05.2018 Taylor & Francis LLC
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!