Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
In this paper, we present a literature review, classification schemes and analysis of methodology for scheduling problems on batch processing machine (BP) with both processing time and job size constraints which is also regarded as two-dimensional (TD) scheduling. Special attention is given to scheduling problems with non-identical job sizes and processing times, as well as the details of the basic algorithms, and related significant results.
International Journal of Manufacturing Research – Inderscience Publishers
Published: Jan 1, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.