Abstract
We consider the problem of minimizing the makespan on a batch processing machine, in which jobs are not all compatible. Only compatible jobs can be included into the same batch. This relation of compatibility is represented by a graph (called compatibility graph), which is assumed to be bipartite. The capacity of the batch processing machine is equal to 2. Furthermore, the jobs have release dates. The processing time of a batch is given by the processing time of the longest job in the batch. We establish that the general problem is NP-hard in the strong sense, but that several special cases can be solved in polynomial time. A heuristic is also presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
