Title: The Unbounded Parallel Batch Machine Scheduling with Rejection
Abstract: In this paper,the authors consider the single unbounded parallel batch scheduling problem which minimizes the objective function for the maximum delay and the workpiece is rejected and the penalty costs for the first time.The authors show that this problem is NP-hard and provide a pseudo-polynomial-time algorithm based on dynamic programming.
Publication Year: 2011
Publication Date: 2011-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