Title: Scheduling Problems on Parallel Identical Unbounded Batch Processing Machines
Abstract: The problem of scheduling jobs with diferent release dates or same release dates on parallel identical unbounded batch processing machines to minimize several scheduling criteria is considered. Pseudo-polynomial time dynamic programming algorithm, or fully polynomial time approximation scheme is developed for the scheduling problem under consideration, respectively.
Publication Year: 2013
Publication Date: 2013-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot