The scheduling problem where multiple machines compete for a common local buffer
From MaRDI portal
Publication:1127173
DOI10.1016/0377-2217(93)E0352-XzbMath0927.90050MaRDI QIDQ1127173
Publication date: 13 August 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0352-x
multiple machines; restricted buffer space; scheduling jobshops; sum of weighted completion times; two-stage flowshop
Related Items
A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers, Scheduling batches in flowshop with limited buffers in the shampoo industry, A sequencing approach for creating new train timetables
Cites Work