@article {IOPORT.06047250,
    author       = {Mosheiov, Gur and Oron, Daniel},
    title        = {Batch scheduling on a two-machine jobshop with machine-dependent setup times.},
    year         = {2011},
    journal      = {Naval Research Logistics},
    volume       = {58},
    number       = {7},
    issn         = {0894-069X},
    pages        = {676-684},
    publisher    = {John Wiley \& Sons, Hoboken, NJ},
    doi          = {10.1002/nav.20473},
    abstract     = {Summary: The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs ($m \geq 3$) is known to be strongly NP-hard even with no setup times. We focus in this article on the two-machine case. We assume UET jobs and consider batching with batch availability and machine-dependent setup times. We introduce an efficient $(O (\sqrt n))$ algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances.},
    identifier   = {06047250},
}