Optimisation of flow-shop scheduling with batch processor and limited buffer
This paper deals with a flow-shop scheduling problem with limited intermediate buffer. Jobs are grouped in incompatible job families. Each job has to be processed by a batch processor followed by a discrete processor in the same order. The batch processor can process several jobs simultaneously so t...
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/101662 http://hdl.handle.net/10220/16813 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Be the first to leave a comment!