Title: Single Machine Parallel-batch Scheduling with Release Dates and Machine Availability Constraints
Abstract: The single machine parallel-batch scheduling with release dates and machine availability constraints is considered.There are some disjoint intervals in which the machine cannot be available.The jobs are processed in batches form in the remaining free time-slots without preemption,where the processing time of batch is defined to be the maximum processing time of the jobs in this batch.The pseudopolynomial solvability of the unbounded batch machine scheduling problem with job release dates and machine availability constraints is established for every regular objective.
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