Scheduling a batch processing machine with bipartite compatibility graphs

Mourad Boudhar

Mathematical Methods of Operations Research, 2003, vol. 57, issue 3, 513-527

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. Copyright Springer-Verlag Berlin Heidelberg 2003

Keywords: Key words: batch processing machine; batch scheduling; compatibility graph; bipartite graph (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860300273 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:57:y:2003:i:3:p:513-527

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860300273

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().