Title: Scheduling problem of a continuous batching machine in chains structure
Abstract: For the problem that the job release times and due dates are assumed to be agreeable in chains structure, the objectives are to schedule jobs on the machine so that the maximum tardiness is minimized. It is NP-hard in the strong sense even for the case of unit processing time, and also provide polynomial algorithm to obtain the optimal solution for the case when the due dates in same chain are equal to each other.
Publication Year: 2008
Publication Date: 2008-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